A New ID-Based Proxy Multi-Signature Scheme from Bilinear Pairings

ID-based public key cryptosystem can be a good alternative for certifieate-based public key setting. This paper provides an efficient ID-based proxy multi signature scheme from pairings. In the random oracle model, we prove that our new scheme is secure against existential delegation forgery with the assumption that Hess＇s scheme-1 is existential unforgeable, and that our new scheme is secure against existential proxy multi-signature forgery under the hardness assumption of the computational Diffie-Hellman problem.

SECURITY ANALYSIS AND IMPROVEMENT OF A NEW THRESHOLD MULTI-PROXY MULTI-SIGNATURE SCHEME

Kang, et al. [Journal of Electronics(China), 23(2006)4] proposed a threshold multi-proxy multi-signature scheme, and claimed the scheme satisfies the security requirements of threshold multi-proxy multi-signature. However, in this paper, two forgery attacks are proposed to show that their schemes have serious security flaws. To overcome theses flaws, an improvement on Kang, et al.’s scheme is proposed.

Provable Security of ID-Based Proxy Multi-Signature Schemes

In the last couple of years, D-based cryptography has got fruitful achievements. Proxy multi-signature allows a designated person, called a proxy signer, to sign on behalf of two or more original signers. In this paper, we present a general security model for ID-based proxy multi-signature （ID-PMS） schemes. Then, we show how to construct a secure ID-PMS scheme from a secure ID-based signature scheme, and prove that the security of the construction can be reduced to the security of the original ID-based signature scheme.

A NEW THRESHOLD MULTI-PROXY MULTI-SIGNATURE SCHEME

This paper proposes a threshold mult-proxy multi-signature scheme with share verification. In the scheme, a subset of original signers allows a designated group of proxy signers to sign on behalf of the original group. A message m has to be signed by a subset of proxy signers who can represent the proxy group. Then, the proxy signature is sent to the verifier group. A subset of verifiers in the verifier group can also represent the group to authenticate the proxy signature. In other words, some threshold values will be given to indicate the number of persons to represent a group to authorize the signing capability or to sign a message or to verify the proxy signature.

Identity-based proxy multi-signature applicable to secure E-transaction delegations

To enhance the robustness of a proxy multi-signature scheme and improve its efficiency, a novel proxy signature paradigm is proposed referred to as In this paradigm, multiple proxy signer candidates identity-based proxy multi-signature （IBPMS）. are employed to play a role of the single proxy signer in the existing model. A provably secure IBPMS scheme is presented which requires only one round broadcast operation. Performance analysis demonstrates that the new scheme outperforms the existing multi-signature schemes in robustness and communication. These properties are rendered to our IBPMS scheme as a more practical solution to secure e-transaction delegation applications of proxy signatures.

An Energy Trading Method Based on Alliance Blockchain and Multi-Signature

Blockchain,known for its secure encrypted ledger,has garnered attention in financial and data transfer realms,including the field of energy trading.However,the decentralized nature and identity anonymity of user nodes raise uncertainties in energy transactions.The broadcast consensus authentication slows transaction speeds,and frequent single-point transactions in multi-node settings pose key exposure risks without protective measures during user signing.To address these,an alliance blockchain scheme is proposed,reducing the resource-intensive identity verification among nodes.It integrates multi-signature functionality to fortify user resources and transac-tion security.A novel multi-signature process within this framework involves neutral nodes established through central nodes.These neutral nodes participate in multi-signature’s signing and verification,ensuring user identity and transaction content privacy.Reducing interactions among user nodes enhances transaction efficiency by minimizing communication overhead during verification and consensus stages.Rigorous assessments on reliability and operational speed highlight superior security performance,resilient against conventional attack vectors.Simulation shows that compared to traditional solutions,this scheme has advantages in terms of running speed.In conclusion,the alliance blockchain framework introduces a novel approach to tackle blockchain’s limitations in energy transactions.The integrated multi-signature process,involving neutral nodes,significantly enhances security and privacy.The scheme’s efficiency,validated through analytical assessments and simulations,indicates robustness against security threats and improved transactional speeds.This research underscores the potential for improved security and efficiency in blockchain-enabled energy trading systems.

An Improved Proxy Multi-Signature Scheme

Based on the Kim-like's proxy multi-signature scheme, an improved proxymulti-signature scheme is proposed. The new scheme overcomes the two problems in the Kim-like'sproxy multi-signature scheme: (1) Security issue ( every original signer can forge a valid proxymulti-signature for any message); (2) Efficiency issue ( both the size of the proxy multi-signatureand the efficiency of signature checking are dependent on the number of the original signers).

Efficient ID-based proxy multi-signature scheme secure in random oracle

Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.

Quantum homomorphic broadcast multi-signature based on homomorphic aggregation

Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.

IMPROVEMENT OF NONREPUDIABLE THRESHOLD MULTI-PROXY THRESHOLD MULTI-SIGNATURE SCHEME WITH SHARED VERIFICATION

In 2005, Bao, et al. [Appl. Math. and Comput., vol.169, No.2, 2005] showed that Tzeng, et al.’s nonrepudiable threshold multi-proxy multi-signature scheme with shared verification was insecure, and proposed an improved scheme with no Share Distribution Center (SDC). This paper shows that Bao, et al.’s scheme suffers from the proxy relationship inversion attack and forgery attack, and pro- poses an improvement of Bao, et al.’s scheme.

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 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.

Applying two channels to vector space secret sharing based multi-signature scheme

Secret sharing and digital signature is an important research area in information security and has wide applications in such fields as safeguarding and legal use of confidential information, secure multiparty computation and electronic commerce. But up to now, study of signature based on general vector space secret sharing is very weak. Aiming at this drawback, the authors did some research on vector space secret sharing against cheaters, and proposed an efficient but secure vector space secret sharing based multi-signature scheme, which is implemented in two channels. In this scheme, the group signature can be easily produced if an authorized subset of participants pool their secret shadows and it is impossible for them to generate a group signature if an unauthorized subset of participants pool their secret shadows. The validity of the group signature can be verified by means of verification equations. A group signature of authorized subset of participants cannot be impersonated by any other set of partici- pants. Moreover, the suspected forgery can be traced, and the malicious participants can be detected in the scheme. None of several possible attacks can successfully break this scheme.

Efficient and Secure Multi-Signature Scheme Based on Trusted Computing

A new multi-signature scheme was proposed with the extension of the direct anonymous attestation （DAA） protocol supported by trusted computing （TC） technology. Analysis and simulation results show that the signer＇s privacy is well protected with dynamic anonymity, the public key and signatures have length independent of the number of signature members, new signers are allowed to join the signature without modifying the public key, and attacks caused by secret key dumping or leaking can be avoided.

A New Sequential Digital Multi-Signature Scheme

The paper proposes a new sequential digital multi-signature scheme based on Knapsack public-key cryptosystem,which is different from the existing scheme.The advantages of this scheme over the existing schemes are that it simplifies the signature generation process and speeds up the signature verification process.What’s more,the scheme reduces the cost of communication and redundancy operation, and improves efficiency,and can avoid cheating by signer efficiently,so the scheme has very broad application prospects.

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.

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

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