Concurrent-secure Blind Signature Scheme without Random Oracles
In the context of blind signature schemes, how to devise efficient and concurrent-secure blind signature scheme without random oracles has been a very active research topic. Recently, Gjestcen et al. proposed a round-optimal blind signature scheme in the registered public key model. Unfortunately, this scheme has the drawback that the costs of computation and communication of its signing protocol are linear in the size of the message to be signed. The main contribution of this paper is a revised scheme which is built on the Zhou-Lin signature scheme, the compilation technique of Damg(a)rd et al., and Aritas straight-line extractable commitment scheme. The salient features of the new scheme are that the costs of computation and communication of its signing protocol do not depend on the size of the message to be signed. In addition, the resultant signature is very short and has an efficient verification process. Moreover, thanks to the technique of straight-line extraction, the security reduction algorithm is efficient and runs in strictly polynomial-time.
blind signatures the registered public-key model concurrent non-interactive zero-knowledge
Liu Xin
Department of Information Engineering Shandong Youth University of Political Science School of Computer Science and Technology Shandong University Jinan, China
国际会议
重庆
英文
90-94
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）