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.

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.

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.

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.

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 ID-Based Proxy Blind Signature Scheme

An identity-based proxy blind signature scheme from bilinear pairings isintroduced, which combines the advantages of proxy signature and blind signature. Furthermore, ourscheme can prevent the original signer from generating the proxy blind signature, thus the profitsof the proxy signer are guaranteed. We introduce bilinear pairings to minimize computationaloverhead and to improve the related performance of our scheme. In addition, the proxy blindsignature presented is non-repudiable and it fulfills perfectly the security requirements of a proxyblind signature.

Efficient ID-Based Proxy Blind Signature Scheme

In a proxy blind signature scheme, the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting and e-payment. In this paper, we propose an identity-based proxy blind signature scheme which combines the advantages of proxy signature and of blind signature. Our scheme fulfills peffecdy the security requirements of a proxy blind signature. Comparing the previous scheme, our scheme needs less computational overhead and is more efficient.

A Proxy Blind Signature Scheme Based on DLP

A proxy signature scheme allows an original signer to delegate his signing capability to a proxy signer who can sign on behalf of the original signer. A blind signature is the concept with a salient feature that the signer can not make a linkage between the blind signature and the identity of the requester. Proxy signature and blind signature are used widely in electronic commerce. With satisfying the security properties of both two signatures, a new proxy blind signature scheme based on discrete logarithm problem is proposed.

A New Anti-Quantum Proxy Blind Signature for Blockchain-Enabled Internet of Things

Blockchain technology has become a research hotspot in recent years with the prominent characteristics as public,distributed and decentration.And blockchain-enabled internet of things(BIoT)has a tendency to make a revolutionary change for the internet of things(IoT)which requires distributed trustless consensus.However,the scalability and security issues become particularly important with the dramatically increasing number of IoT devices.Especially,with the development of quantum computing,many extant cryptographic algorithms applied in blockchain or BIoT systems are vulnerable to the quantum attacks.In this paper,an anti-quantum proxy blind signature scheme based on the lattice cryptography has been proposed,which can provide user anonymity and untraceability in the distributed applications of BIoT.Then,the security proof of the proposed scheme can derive that it is secure in random oracle model,and the efficiency analysis can indicate it is efficient than other similar literatures.

CONSTRUCTION OF PROXY BLIND SIGNATURE SCHEME BASED ON MULTI-LINEAR TRANSFORM

A general method of constructing proxy blind signature is proposed based on multilinear transform. Based on this method, the four proxy blind signature schemes are correspondently generated with four different signature equations, and each of them has four forms of variations of signs. Hence there are sixteen signatures in all, and all of them are proxy stronglyblind signature schemes. Furthermore, the two degenerated situations of multi-linear transform are discussed. Their corresponding proxy blind signature schemes are shown, too. But some schemes come from one of these degenerate situations are proxy weakly-blind signature scheme.The security for proposed scheme is analyzed in details. The results indicate that these signature schemes have many good properties such as unforgeability, distinguish-ability of proxy signature,non-repudiation and extensive value of application etc.

A NEW EFFICIENT ID-BASED PROXY BLIND SIGNATURE SCHEME

In a proxy blind signature scheme,the proxy signer is allowed to generate a blind signature on behalf of the original signer. The proxy blind signature scheme is useful in several applications such as e-voting,e-payment,etc. Recently,Zheng,et al. presented an IDentity(ID) -based proxy blind sig-nature. In this paper,a new efficient ID-based proxy blind signature scheme from bilinear pairings is proposed,which can satisfy the security properties of both the proxy signatures and the blind signature schemes. Analysis of the scheme efficiency shows that the new scheme is more efficient than Zheng,et al.'s scheme. The proposed scheme is more practical in the real world.

Publicly Verifiable Distributed Proxy Blind Signature Scheme

In this present paper, we propose a new proxy blind signature scheme, which is publicly verifiable distributed. The algorithm uses the idea of secret sharing schemes to distribute original signer＇s ability and the power of the proxy signer, and ensure the property of publicly verifiable secret sharing schemes. A new concept ＂verifiable time period＂ is also introduced to reduce the time cost in the period of verifications and increases the efficiency of our scheme.

An Efficient Proxy Blind Signcryption Scheme for IoT

Recent years have witnessed growing scientific research interest in the Internet of Things(IoT)technologies,which supports the development of a variety of applications such as health care,Industry 4.0,agriculture,ecological data management,and other various domains.IoT utilizes the Internet as a prime medium of communication for both single documents as well as multi-digital messages.However,due to the wide-open nature of the Internet,it is important to ensure the anonymity,untraceably,confidentiality,and unforgeability of communication with efficient computational complexity and low bandwidth.We designed a light weight and secure proxy blind signcryption for multi-digital messages based on a hyperelliptic curve(HEC).Our results outperform the available schemes in terms of computational cost and communication bandwidth.The designed scheme also has the desired authentication,unforgeability of warrants and/or plaintext,confidentiality,integrity,and blindness,respectively.Further,our scheme is more suitable for devices with low computation power such as mobiles and tablets.

一种新的基于身份的代理多重盲签名方案

代理签名是解决签名权利委托的一种方案,代理签名可以结合其他特殊的签名方案生成一些新的代理签名方案.代理多重签名可以解决一个签名人代替多个原始签名人签名的问题,盲签名用于隐藏原始消息.结合代理多重签名和盲签名的特性,从双线性对的角度提出一种基于身份的代理多重盲签名方案,私钥生成器利用每个签名人本人身份生成不同的密钥.通过对方案的安全性分析,发现该方案可以抵抗原始签名者内部攻击,防止代理签名权的滥用,具有不可伪造性、不可否认性、不可链接性、盲性和计算效率高的特点.

Improvement of M-U-O and K-P-W proxy signature schemes

The concept of proxy signature introduced by Mambo, Usuda, and Okamoto allows a designated person, called a proxy signer, to sign on behalf of an original signer in 1996. However, most existing proxy signature schemes does not support nonrepudiation. In this paper, we propose two secure nonrepudiable proxy signature schemes, which overcome disadvantages of M U O and K P W proxy signature schemes, respectively. The schemes proposed can withstand public key substitution attack and forge attack. In addition, our new schemes have some other advantages such as proxy signature key generation and updating using insecure channels. Our approach can also be applied to other ElGamal like proxy signature schemes.

双向隐私保护量子投票协议

量子投票协议是利用量子的部分特性设计的电子投票协议.目前的量子投票协议忽略了双向隐私保护,即在保证投票者隐私的前提下,对落选者投票信息的隐私保护.设计了一个六方参与的量子投票协议,应用五粒子纠缠态实现量子代理盲签名,应用半量子秘密比较协议实现票数的秘密比较.前者能够分离投票者身份信息和投票信息以实现对投票者隐私的保护,后者能够秘密比较候选人票数以实现对候选人隐私的保护.设计的量子投票协议以传统量子投票协议为框架,增添了新功能,投票过程安全可靠可监督,协议传统安全性和抗量子性得到了保证,且无过多量子资源的使用,可以实现完整的大基数投票过程.

智能电网中基于代理盲签密的隐私保护方案

在智能电网中,电力和信息在用户节点和服务节点间的双向流通属性给用户数据的隐私安全带来巨大威胁,同时电力局计算资源的限制也给用户带来响应延迟、服务质量下降等问题。结合边缘计算技术,提出一种基于无证书的不使用双线性映射的代理盲签密方案,通过对电力和信息的盲化,使签密者无法得知用户的具体用电信息,确保用户的数据隐私安全。使用代理密钥更新机制实现前向安全性,并对用户的签密密文进行批量验证。在随机谕言机模型下,基于计算性Diffie-Hellman问题和椭圆曲线上的离散对数问题,证明该方案在适应性选择密文攻击下的机密性,以及在适应性选择明文攻击下的不可伪造性,能够为智能电网中传输的数据隐私提供安全保护。在MIRACL库上的仿真实验结果表明,该方案在执行代理授权和验证、代理密钥生成、签密、解签密算法时所花费的总运行时间为5.616 ms,密文长度为80 Byte,与现有其他文献中的文案相比,最多能分别降低85.7%、85%。

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.

基于离散对数新的多重代理多重盲签名方案

为了抵抗原始签名者内部攻击,代理授权信息以及签名信息不需要通过安全信道被安全传递,对提高签名方案的速率具有重要意义.在基于离散对数的多重代理多重盲签名方案的基础上,通过改进代理私钥,结合哈希求逆函数困难的方法,提出一种新的基于离散对数的多重代理多重盲签名方案.同时给出签名方案详细的授权过程、签名过程和验证过程.通过对方案的正确性和安全性分析,表明该方案具有不可否认性、不可链接性和盲性等特点.