A Blockchain-Based Proxy Re-Encryption Scheme with Conditional Privacy Protection and Auditability

With the development of Internet of Things technology,intelligent door lock devices are widely used in the field of house leasing.In the traditional housing leasing scenario,problems of door lock information disclosure,tenant privacy disclosure and rental contract disputes frequently occur,and the security,fairness and auditability of the housing leasing transaction cannot be guaranteed.To solve the above problems,a blockchain-based proxy re-encryption scheme with conditional privacy protection and auditability is proposed.The scheme implements fine-grained access control of door lock data based on attribute encryption technology with policy hiding,and uses proxy re-encryption technology to achieve auditable supervision of door lock information transactions.Homomorphic encryption technology and zero-knowledge proof technology are introduced to ensure the confidentiality of housing rent information and the fairness of rent payment.To construct a decentralized housing lease transaction architecture,the scheme realizes the efficient collaboration between the door lock data ciphertext stored under the chain and the key information ciphertext on the chain based on the blockchain and InterPlanetary File System.Finally,the security proof and computing performance analysis of the proposed scheme are carried out.The results show that the scheme can resist the chosen plaintext attack and has low computational cost.

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

NC-MACPABE: Non-centered multi-authority proxy re-encryption based on CP-ABE for cloud storage systems

The cloud storage service cannot be completely trusted because of the separation of data management and ownership, leading to the difficulty of data privacy protection. In order to protect the privacy of data on untrusted servers of cloud storage, a novel multi-authority access control scheme without a trustworthy central authority has been proposed based on CP-ABE for cloud storage systems, called non-centered multi-authority proxy re-encryption based on the cipher-text policy attribute-based encryption(NC-MACPABE). NC-MACPABE optimizes the weighted access structure(WAS) allowing different levels of operation on the same file in cloud storage system. The concept of identity dyeing is introduced to improve the users' information privacy further. The re-encryption algorithm is improved in the scheme so that the data owner can revoke user's access right in a more flexible way. The scheme is proved to be secure. And the experimental results also show that removing the central authority can resolve the existing performance bottleneck in the multi-authority architecture with a central authority, which significantly improves user experience when a large number of users apply for accesses to the cloud storage system at the same time.

Multi-authority proxy re-encryption based on CPABE for cloud storage systems

The dissociation between data management and data ownership makes it difficult to protect data security and privacy in cloud storage systems.Traditional encryption technologies are not suitable for data protection in cloud storage systems.A novel multi-authority proxy re-encryption mechanism based on ciphertext-policy attribute-based encryption（MPRE-CPABE） is proposed for cloud storage systems.MPRE-CPABE requires data owner to split each file into two blocks,one big block and one small block.The small block is used to encrypt the big one as the private key,and then the encrypted big block will be uploaded to the cloud storage system.Even if the uploaded big block of file is stolen,illegal users cannot get the complete information of the file easily.Ciphertext-policy attribute-based encryption（CPABE）is always criticized for its heavy overload and insecure issues when distributing keys or revoking user＇s access right.MPRE-CPABE applies CPABE to the multi-authority cloud storage system,and solves the above issues.The weighted access structure（WAS） is proposed to support a variety of fine-grained threshold access control policy in multi-authority environments,and reduce the computational cost of key distribution.Meanwhile,MPRE-CPABE uses proxy re-encryption to reduce the computational cost of access revocation.Experiments are implemented on platforms of Ubuntu and CloudSim.Experimental results show that MPRE-CPABE can greatly reduce the computational cost of the generation of key components and the revocation of user＇s access right.MPRE-CPABE is also proved secure under the security model of decisional bilinear Diffie-Hellman（DBDH）.

Key-Private Identity-Based Proxy Re-Encryption

An identity-based proxy re-encryption scheme(IB-PRE)allows a semi-trusted proxy to convert an encryption under one identity to another without revealing the underlying message.Due to the fact that the proxy was semi-trusted,it should place as little trust as necessary to allow it to perform the translations.In some applications such as distributed file system,it demands the adversary cannot identify the sender and recipient’s identities.However,none of the exiting IB-PRE schemes satisfy this requirement.In this work,we first define the security model of key-private IB-PRE.Finally,we propose the first key-private IB-PRE scheme.Our scheme is chosen plaintext secure(CPA)and collusion resistant in the standard model.

The Development of Proxy Re-Encryption

With the diversification of electronic devices,cloud-based services have become the link between different devices.As a cryptosystem with secure conversion function,proxy re-encryption enables secure sharing of data in a cloud environment.Proxy re-encryption is a public key encryption system with ciphertext security conversion function.A semi-trusted agent plays the role of ciphertext conversion,which can convert the user ciphertext into the same plaintext encrypted by the principal’s public key.Proxy re-encryption has been a hotspot in the field of information security since it was proposed by Blaze et al.[Blaze,Bleumer and Strauss(1998)].After 20 years of development,proxy re-encryption has evolved into many forms been widely used.This paper elaborates on the definition,characteristics and development status of proxy re-encryption,and classifies proxy re-encryption from the perspectives of user identity,conversion condition,conversion hop count and conversion direction.The aspects of the existing program were compared and briefly reviewed from the aspects of features,performance,and security.Finally,this paper looks forward to the possible development direction of proxy re-encryption in the future.

Quantum circuit-based proxy blind signatures:A novel approach and experimental evaluation on the IBM quantum cloud platform

This paper presents a novel approach to proxy blind signatures in the realm of quantum circuits,aiming to enhance security while safeguarding sensitive information.The main objective of this research is to introduce a quantum proxy blind signature(QPBS)protocol that utilizes quantum logical gates and quantum measurement techniques.The QPBS protocol is constructed by the initial phase,proximal blinding message phase,remote authorization and signature phase,remote validation,and de-blinding phase.This innovative design ensures a secure mechanism for signing documents without revealing the content to the proxy signer,providing practical security authentication in a quantum environment under the assumption that the CNOT gates are securely implemented.Unlike existing approaches,our proposed QPBS protocol eliminates the need for quantum entanglement preparation,thus simplifying the implementation process.To assess the effectiveness and robustness of the QPBS protocol,we conduct comprehensive simulation studies in both ideal and noisy quantum environments on the IBM quantum cloud platform.The results demonstrate the superior performance of the QPBS algorithm,highlighting its resilience against repudiation and forgeability,which are key security concerns in the realm of proxy blind signatures.Furthermore,we have established authentic security thresholds(82.102%)in the presence of real noise,thereby emphasizing the practicality of our proposed solution.

A Data Transmission Approach Based on Ant Colony Optimization and Threshold Proxy Re-encryption in WSNs

Wireless sensor networks(WSNs)have become increasingly popular due to the rapid growth of the Internet of Things.As open wireless transmission media are easy to attack,security is one of the primary design concerns for WSNs.Current solutions consider routing and data encryption as two isolated issues,providing incomplete security.Therefore,in this paper,we divide the WSN communication process into a data path selection phase and a data encryption phase.We propose an improved transmission method based on ant colony optimization(ACO)and threshold proxy re-encryption for WSNs,and we named it as ACOTPRE.The method resists internal and external attacks and ensures safe and efficient data transmission.In the data path selection stage,the ACO algorithm is used for network routing.The improvement of the pheromone concentration is proposed.In order to resist attacks from external attackers,proxy re-encryption is extended to WSN in the data encryption stage.The threshold secret sharing algorithm is introduced to generate a set of re-encryption key fragments composed of random numbers at the source node.We confirm the performance of our model via simulation studies.

A Proxy Re-Encryption with Keyword Search Scheme in Cloud Computing

With the widespread use of cloud computing technology,more and more users and enterprises decide to store their data in a cloud server by outsourcing.However,these huge amounts of data may contain personal privacy,business secrets and other sensitive information of the users and enterprises.Thus,at present,how to protect,retrieve,and legally use the sensitive information while preventing illegal accesses are security challenges of data storage in the cloud environment.A new proxy re-encryption with keyword search scheme is proposed in this paper in order to solve the problem of the low retrieval efficiency of the encrypted data in the cloud server.In this scheme,the user data are divided into files,file indexes and the keyword corresponding to the files,which are respectively encrypted to store.The improved scheme does not need to re-encrypt partial file cipher-text as in traditional schemes,but re-encrypt the cipher-text of keywords corresponding to the files.Therefore the scheme can improve the computational efficiency as well as resist chosen keyword attack.And the scheme is proven to be indistinguishable under Hash Diffie-Hellman assumption.Furthermore,the scheme does not need to use any secure channels,making it more effective in the cloud environment.

A Multi-Conditional Proxy Broadcast Re-Encryption Scheme for Sensor Networks

In sensor networks,it is a challenge to ensure the security of data exchange between packet switching nodes holding different private keys.In order to solve this problem,the present study proposes a scheme called multi-conditional proxy broadcast re-encryption(MC-PBRE).The scheme consists of the following roles:the source node,proxy server,and the target node.If the condition is met,the proxy can convert the encrypted data of the source node into data that the target node can directly decrypt.It allows the proxy server to convert the ciphertext of the source node to a new ciphertext of the target node in a different group,while the proxy server does not need to store the key or reveal the plaintext.At the same time,the proxy server cannot obtain any valuable information in the ciphertext.This paper formalizes the concept of MC-PBRE and its security model,and proposes a MC-PBRE scheme of ciphertext security.Finally,the scheme security has been proved in the random oracle.

Comparative analysis of extreme ultraviolet solar radiation proxies during minimum activity levels

Four extreme ultraviolet(EUV)solar radiation proxies(Magnesium II core-to-wing ratio(MgII),Lymanαflux(Fα),10.7-cm solar radio flux(F10.7),and sunspot number(Rz))were analyzed during the last four consecutive solar activity minima to investigate how they differ during minimum periods and how well they represent solar EUV radiation.Their variability within each minimum and between minima was compared by considering monthly means.A comparison was also made of their role in filtering the effect of solar activity from the critical frequency of the ionospheric F2 layer,foF2,which at mid to low latitudes depends mainly on EUV solar radiation.The last two solar cycles showed unusually low EUV radiation levels according to the four proxies.Regarding the connection between the EUV“true”variation and that of solar proxies,according to the foF2 filtering analysis,MgII and Fαbehaved in a more stable and suitable way,whereas Rz and F10.7 could be overestimating EUV levels during the last two minima,implying they would both underestimate the inter-minima difference of EUV when compared with the first two minima.

A Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing.One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results.Linearly homomorphic proxy signature(LHPS)is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right.Blockchain has the characteristics of tamper-proof and traceability,and is a new technology to solve data security.However,as far as we know,constructions of LHPS have been few and far between.In addition,the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology.Herein,we improve the security model of the LHPS scheme,and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered.Under the new model,we present a blockchain-based LHPS scheme.The security analysis shows that under the adaptive chosen message attack,the unforgeability of the proposed scheme can be reduced to the CDH hard assumption,while achieving the usual and homomorphic existential unforgeability.Moreover,comparedwith the previous LHPS scheme,the performance analysis shows that our scheme has the same key size and comparable computational overhead,but has higher security.

The Connection Between Medical Self-determination and the System of Adult Guardianship——The Institutional Construction of Medical Proxy

China has established the basic rules of informed consent in the medical field through Articles 1219 and 1220 of the tort liability part of the Civil Code of China to address the legality of medical conduct.Since patients’capacity to consent is the prerequisite,when the patient is a fully competent person,it is sufficient to give consent based on valid notification by the doctor.However,for those who are unable to give valid consent,especially adult patients with impaired capacity,resolving the legality of the doctor’s medical conduct remains an issue when it infringes on the patient’s body and health.To solve this issue,someone must give consent in place of the patient when the adult is unable to give valid consent.However,the personal and exclusive nature of the right to medical consent,which is informed consent,makes it impossible to simply delegate it to a guardian or other person to exercise it on behalf of the patient.In this paper,we borrow the concept of“medical proxy”proposed by Japanese scholar Teruaki Tayama,and for the first time,we discuss the construction of medical proxy from the perspective of adult guardianship by connecting the two systems from the standpoint of interpretive theory.

一种航天器在轨环境下结构变形的反演方法

为实现航天器在轨结构变形高效计算,提出一种基于神经网络的结构变形反演方法:借助有限元分析法获得结构在不同温度载荷作用下的变形分布特征,并利用获取的数据对输入和输出间神经网络进行训练,获取高精度的代理模型。利用该模型,可以在轨测量的温度作为输入,实现对航天器结构全场变形的快速反演;可通过引入合适参数的高斯噪声,增强神经网络对于输入误差的适应能力;可用改进的连接权值分析方法,给出确定传感器数量下,实现变形反演精度最高的结构温度测点的布局优化方案。综上,该反演方法具有精度高、实时性强、受输入误差影响小等优点,其应用对于提升遥感卫星的成像质量具有重要意义。

枪械击发点火系统的点火可靠性仿真分析

为了提高枪械击发点火系统的点火可靠性,研究以一种小口径步枪击发点火系统为研究对象,设计系统模拟试验装置,开展了系统点火性能和可靠性试验研究。在此基础上,采用拉格朗日-欧拉流固耦合方法(ALE)建立了击发点火系统的点火模型,并搭建了参数化仿真平台,以压力启动时间为点火输出性能表征参数,建立了枪械击发点火系统的点火可靠性分析模型。通过将模型计算结果与试验数据进行对比验证,并模拟研究了击发点火系统结构和装配参数变化影响下的可靠性。结果表明:枪械击发点火可靠性分析模型计算结果与试验结果误差为0.72%,模型具有较好的准确性;各因素均值变化对系统可靠性的影响规律为:击针突出量>闭锁间隙>火台头部直径>底火壳厚度>底火装入深度>击针头部直径;标准差变化对系统可靠性影响较小。这些研究结果可为枪械击发点火系统的可靠性设计提供参考。

基于代理指标的供水管网抗震改造优化

基于水力模型计算的管网供水量满足率(SSIQ)指标,是评估供水管网震后性能的常用指标。在供水管网抗震改造优化模型中,若采用SSIQ表示优化目标函数,优化求解需进行大量水力模型计算,计算耗时很长。为减小管网抗震改造优化模型的计算量,对节点流量韧性指标(FR)进行了改进,增加了管道破坏漏水能量损失的影响项,提出了一种管网能量指标(Energy Resilience, ER)表示震后管网性能;以ER指标作为SSIQ的代理指标,用于量化抗震改造优化模型的目标函数。仅通过管道地震失效概率、管网震前正常运行工况的水力参数计算ER指标,不必进行震后管网水力模型计算,以期提升优化模型计算效率。以供水管网震后性能最大化和改造费用最小化为目标,以管道抗震改造措施为优化变量,建立了管网抗震改造多目标优化模型,并比较了ER指标、FR指标以及两个拓扑代理指标的替代效果。案例管网应用结果表明,ER指标与SSIQ指标相关系数呈现强相关性,基于ER指标的优化方案与基于SSIQ指标的优化方案的差异小于3%,ER指标优化模型计算时间不足SSIQ指标优化模型计算时间的1%。

基于代理模型的双气隙混合转子低速大转矩同步电机优化设计

为解决常规低速大转矩电机普遍存在体转矩密度低、永磁体用量多等问题,提出了一种双气隙混合转子低速大转矩同步电机拓扑结构。然而,该种电机结构相对复杂、设计参数多、优化难度大,对此提出了一种基于代理模型的双气隙混合转子低速大转矩同步电机高效优化设计方法。首先,以提高输出转矩与降低转矩脉动为优化目标,对电机的参数进行敏感性分析,实现了在保证代理模型精确度的基础上精简优化变量。然后,为提高该种电机多目标优化设计的精确度和效率,同时缩短优化周期,提出了一种序贯子空间与模式搜索算法相结合的优化算法对电机进行优化处理。最后通过有限元仿真与实验方法验证了所构建代理模型的精确性、合理性和优化方法的有效性、先进性。

委托代持担保物权的法律效力

在特定的交易模式中,担保物权可由他人代为持有。为使金融交易方式更加灵活便捷,应缓和担保物权设立上的从属性,允许为将来债权提供担保,在担保物权可得实现之时,主债权真实存在即可。在权利归属认定中,法院不宜恪守于权利登记内容,在不影响第三人权益的前提下,应尊重当事人间的真实意思表示,认定债权人为实际权利人。倘若名义权利人将登记系统上所登记的债权及担保物权无权处分给第三人,善意取得规则自有适用空间。在担保物权可得实现之时,原则上债权人和受托人均可行使担保物权。在特殊情形下,担保物权的行使主体可由当事人约定。

基于SSA-BP神经网络的车-轨-桥系统随机振动分析

轨道及桥梁结构参数随机性对车-轨-桥耦合系统的振动影响不能忽略。基于代理模型研究轨道-桥梁间3层弹簧刚度和弹簧阻尼以及桥梁刚度和阻尼的随机性对竖向车-轨-桥耦合系统动力响应的影响。首先,基于经典的车-轨-桥耦合系统力学模型(没有考虑桥墩),采用Monte-Carlo生成2 000个样本集,作为代理模型的训练集。然后,对比SSA-BP(麻雀优化BP算法)与传统BP神经网络、GA-BP神经网络(遗传优化BP算法)对车辆和桥梁响应的预测精度,同时探讨样本数量以及Levenberg-Marquardt和Bayesian Regulation训练算法对SSA-BP神经网络预测精度的影响。最后,假定各随机参数概率分布规律服从高斯型正态分布,所有随机参数变异系数均分为0.05、0.10、0.15、0.20、0.25等5个级别,采用所提出的SSA-BP神经网络研究轨道及桥梁的刚度和阻尼变化对车辆和桥梁响应极值的影响。结果表明:与经典的车-轨-桥耦合系统力学模型相比,所提出的代理模型具有更高的计算效率;SSA-BP模型对车辆和桥梁响应的预测精度高于GA-BP模型,GA-BP模型的预测精度高于传统的BP模型;SSA-BP模型采用Levenberg-Marquardt训练算法对车辆和桥梁响应的预测精度优于Bayesian Regulation训练算法的预测精度;道砟和桥梁之间弹簧刚度的随机变化对桥梁随机振动响应尤为明显;钢轨和轨枕之间弹簧刚度的随机性对车体响应的影响不可忽视,而桥梁刚度和阻尼随机性对车体的影响可不考虑。研究成果可为车轨桥系统随机振动响应预测进一步研究提供依据和参考。

云存储与区块链相结合的电子数据共享模型研究

为解决公安局、检察院、法院及其他司法单位间电子数据共享中存在的低共享程度、安全性不足以及业务协同效率低下等问题,综合运用云存储、区块链、非对称加密、密文可搜索和代理重加密等技术,提出了一种云存储技术与联盟区块链技术相结合的电子数据共享模型。通过理论分析和模型构建,表明该模型能够在公检法等司法单位之间实现电子数据的高效、安全可靠和可溯源共享,从而提高了司法协同效率,而且为司法领域的数字化改革提供了理论基础和技术框架,对推动司法工作的数字化转型具有重要的理论和实践意义。