? 实用常数级环签名
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | Help
 
Indexed by   SCIE, EI ...
Bimonthly    Since 1986
Journal of Computer Science and Technology 2018, Vol. 33 Issue (3) :533-541    DOI: 10.1007/s11390-018-1838-z
Special Section on Blockchain and Cryptocurrency Systems << Previous Articles | Next Articles >>
实用常数级环签名
Meng-Jun Qin, Yun-Lei Zhao*, Member, CCF, Zhou-Jun Ma
Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, Shanghai 201203, China;State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an 710126, China;State Key Laboratory of Cryptology, State Cryptology Administration, Beijing 100878, China
Practical Constant-Size Ring Signature
Meng-Jun Qin, Yun-Lei Zhao*, Member, CCF, Zhou-Jun Ma
Shanghai Key Laboratory of Data Science, School of Computer Science, Fudan University, Shanghai 201203, China;State Key Laboratory of Integrated Services Networks, Xidian University, Xi'an 710126, China;State Key Laboratory of Cryptology, State Cryptology Administration, Beijing 100878, China

摘要
参考文献
相关文章
Download: [PDF 248KB]  
摘要 比特币作为一种“安全匿名的数字货币”已经运行了近十年,并且广泛流行,但是根据最近的一些研究发现,比特币提供的只是伪匿名而不是真正的匿名,因而像类似比特币这样的系统中如何真正的保护隐私成为了迫切需要解决的问题。环签名技术就能够很好的保护数字货币中用户的隐私,它最早是由Rivest等人在2006年提出来的,并且是基于DLP假设,并且它能够使得某一个用户代表一组用户进行签名而不用该组中其他用户的参与。环签名中签名的大小是一个值得关注的问题,常数级环签名(签名的大小和环的大小无关)是最佳结果,否则当环的大小变大时,签名的结果对于资源有限的设备来说可能是无法承受的,并且还有可能增重网络传输的负担。通过详细的调研,我们发现目前只有两种签名协议能实现常数级,但是它们的效率都不高。因此实现一个高效的常数级环签名一直以外就是一个开放的问题。在这篇文章中,我们解决这个开放的问题。我们基于双线性对和累加器设计了一种新的环签名技术,并且在随机预言机模型下证明了它的安全性。据我们所知,这是目前最实用的环签名方案。
关键词环签名   常数级   双线性对   累加器     
Abstract: Bitcoin has gained its popularity for almost ten years as a "secure and anonymous digital currency", but according to several recent researches we know that it can only provide pseudonymity rather than real anonymity, and privacy has been one of the main concerns in the system similar to Bitcoin. Ring signature is a good method for those users who need better anonymity in cryptocurrency. It was first proposed by Rivest et al. based upon the discrete logarithm problem (DLP) assumption in 2006, which allows a user to sign a message anonymously on behalf of a group of users even without their coordination. The size of ring signature is one of the dominating parameters, and constant-size ring signature (where signature size is independent of the ring size) is much desirable. Otherwise, when the ring size is large, the resultant ring signature becomes unbearable for power limited devices or lead to heavy burden over the communication network. Though being extensively studied, currently there are only two approaches for constant-size ring signature. Achieving practical constant-size ring signature is a long-standing open problem since its introduction. In this work, we solve this open question. We present a new constant-size ring signature scheme based on bilinear pairing and accumulators, which is provably secure under the random oracle (RO) model. To the best of our knowledge, it stands for the most practical ring signature up to now.
Keywordsring signature   constant size   bilinear pairing   accumulator     
Received 2017-10-31;
本文基金:

This work is supported in part by the National Key Research and Development Program of China under Grant No. 2017YFB0802000, the National Natural Science Foundation of China under Grant Nos. 61472084 and U1536205, the Shanghai Innovation Action Project under Grant No. 16DZ1100200, the Shanghai Science and Technology Development Funds under Grant No. 6JC1400801, and the Shandong Provincial Key Research and Development Program of China under Grant No. 2017CXG0701.

通讯作者: Yun-Lei Zhao     Email: ylzhao@fudan.edu.cn
About author: Meng-Jun Qin received his B.S. degree in computer science from Donghua University, Shanghai, in 2016. He is currently pursuing his M.S. degree in computer science in Fudan University, Shanghai. His research interests include blockchain, consensus algorithm and ring signature.te
引用本文:   
Meng-Jun Qin, Yun-Lei Zhao, Zhou-Jun Ma.实用常数级环签名[J]  Journal of Computer Science and Technology , 2018,V33(3): 533-541
Meng-Jun Qin, Yun-Lei Zhao, Zhou-Jun Ma.Practical Constant-Size Ring Signature[J]  Journal of Computer Science and Technology, 2018,V33(3): 533-541
链接本文:  
http://jcst.ict.ac.cn:8080/jcst/CN/10.1007/s11390-018-1838-z
Copyright 2010 by Journal of Computer Science and Technology