Analysis of efficient quantum multi-proxy signature
- PDF / 240,347 Bytes
- 8 Pages / 439.37 x 666.142 pts Page_size
- 40 Downloads / 192 Views
Analysis of efficient quantum multi-proxy signature Tian-Yin Wang1,2
· Xiao-Xuan Wang1 · Xiao-Qiu Cai1 · Rui-Ling Zhang3
Received: 28 January 2020 / Accepted: 2 July 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract An efficient quantum multi-proxy signature scheme was proposed recently, in which the original signatory Alice distributed her authority to several proxy signatories, and then each proxy signatory can sign the message for her alone. In this work, we give a cryptanalysis on this scheme and then point out an unnoticed problem that the proxy signatory must send the signed message to the verifier when he signs it, which is in conflict with the requirement of digital signatures. Furthermore, this problem will give a good chance for an unreliable proxy signatory to deny his signature on the message. Finally, an improved version is presented, which is more economical and practical with current technology compared with the original scheme. Keywords Digital signature · Proxy signature · Multi-proxy signature · Threshold proxy signature
1 Introduction In 1996, Mambo, Usuda and Okamoto firstly proposed the concept of proxy signature schemes [1], which allows an original signatory authorize another person, called proxy signatory, to issue signatures on behalf of him/her. As an fundamental cryptographic primitive, proxy signature plays an important role in grid computing, mobile agent, mobile communications, e-commerce etc. [2–5].
B
Tian-Yin Wang [email protected] Xiao-Qiu Cai [email protected] Rui-Ling Zhang [email protected]
1
School of Mathematical Science, Luoyang Normal University, Luoyang 471934, China
2
Start Travel Collaborative Innovation Center of Zhongyuan Economic Area, Luoyang Normal University, Luoyang 471934, China
3
School of Information Technology, Luoyang Normal University, Luoyang 471934, China 0123456789().: V,-vol
123
241
Page 2 of 8
T.-Y. Wang et al.
A (t, n) threshold proxy signature scheme is a special one, in which the original signatory Alice distributes her signing authority to n proxy signatories, but requires that if and only if not less than t proxy signatories work together can they generate a valid signature on behalf of her [6]. Due to this property, (t, n) threshold proxy signatures are mainly used to deal with the problem that the original signatory does not trust single proxy signatory. Nevertheless, in some special cases, all proxy signatories may be also reliable, that is the original signatory trust each of them. In order to complete this task, an efficient quantum multi-proxy signature scheme (named QTT-scheme hereafter) was proposed recently [7], in which the original signatory Alice distributed her authority to several proxy signatories, and then each proxy signatory can sign the message for her alone. In essence, the QTT-scheme is a (1, n) threshold proxy signature scheme. Furthermore, the security of the QTT-scheme is not based on the public-key cryptography, but based on the fundamental principles of quantum me
Data Loading...
