? Practical Constant-Size Ring Signature
Journal of Computer Science and Technology
Quick Search in JCST
 Advanced Search 
      Home | PrePrint | SiteMap | Contact Us | FAQ
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 Current Issue | Archive | Adv Search << Previous Articles | Next Articles >>
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

Related Articles
Download: [PDF 248KB]     Export: BibTeX or EndNote (RIS)  
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.
Articles by authors
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.

Corresponding Authors: 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
Cite this article:   
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
Copyright 2010 by Journal of Computer Science and Technology