Username   Password       Forgot your password?  Forgot your username? 

A New Aggregate Signature Scheme in Cryptographic Currency

Volume 13, Number 5, September 2017 - Paper 18  - pp. 754-762
DOI: 10.23940/ijpe.17.05.p18.754762

Chao Yuan*, Mixue Xu, Xueming Si

State Key Laboratory of Mathematical Engineering and Advanced Computing, Information Engineering University, Zhengzhou 450001, China

(Submitted on March 24, 2017; Revised on June 17, 2017; Accepted on August 20, 2017)


With the rise of Bitcoin, cryptographic currencies have attracted more and more attention. Subsequently, other cryptographic currencies were gradually created, such as Zcash, Moreno, Dash and so on. In cryptographic currency, privacy preserving and expansion are two key technical points. In terms of privacy preserving, more effective solutions were proposed in Zcach, Moreno, Dash and other cryptographic currencies systems, in which ring signature, zero knowledge proof and other cryptographic techniques played important roles. But these schemes mainly considered protecting the addresses of both sides of the transaction. In terms of expansion, lightning network and other projects also give solutions. But most of these projects will bring other problems. In this paper, a signature scheme based on the aggregate signature and the elliptic curve algorithm is proposed to hide the transaction value of a single sender and receiver in the transactions which contain multiple inputs and outputs. This signature scheme achieves the purpose of privacy preserving from the transaction value. Further, the correctness proof and security analysis are given in this paper. In addition to that, another signature scheme that combines aggregation signature with bilinear ring signature is proposed. This aggregate ring signature scheme gives another attempt to solve the problem of expansion in the cryptographic currency system only using cryptographic technologies. At the same time, the sender's addresses can be hidden. Similarly, we also confirmed the correctness of this signature scheme.


References: 23

    1. M. Aschbacher, “Finite Group Theory, Second Edition,” Cambridge University Press ,2000
    2. M. Bellare and P. Rogaway, “The Exact Security of Digital Signatures: How to Sign with RSA and Rabin,” In Proceedings of Eurocrypt '96, vol.1070, pp:399-416,1996
    3. D. Boneh, B. Lynn, and H. Shacham, “Short Signatures from the Weil Pairing,” In AsiaCrypt, pp:514–532, 2001
    4. D. Boneh,C. Gentry,B. Lynn, and H. Shacham, “Aggregate and Verifiably Encrypted Signatures from Bilinear Maps ,” Lecture Notes in Computer Science,  vol.2656,no.1,pp:416-432, 2003
    5. D. Boneh, C. Gentry, B. Lynn,and H.Shacham. “A Survey of Two Signature Aggregation Techniques,” CryptoBytes, vol.6,no.2,2003
    6. M. Blum, P. Feldman, and S. Micali, “Non-Interaciiue Zero Knowledge and Its Applications,” Proc. 20th ACM Symposium on Theory of Computing, pp.103-112,1988
    7. M.van Dijk, C.Gentry, S.Halevi, and V. Vaikuntanathan, “Fully Homomorphic Encryption over the Integers,” International Conference on Theory and Applications of Cryptographic Techniques ,Vol.2009,no.4, pp.24-43, 2010
    8. I. Eyal, “The Miner’s Dilemma,” In IEEE Symposium on Security and Privacy, pp.89-103,2015
    9. C.Gentry, “Fully Homomorphic Encryption Using Ideal Lattices,” ACM Symposium on Theory of Computing ,vol.9,no.4 pp.169-178,2009
    10. R Granger, “On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields,” ASIACRYPT 2010
    11. E.Heilman, A. Kendler, and A. Zohar, “Eclipse Attacks on Bitcoins Peer-to-Peer Network,” Usenix Conference on Security Symposium, USENIX Association, vol.45, no.3, pp.129-144,2015
    12. A Joux and V Vitse, “Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields,” Journal of Cryptology, 2010
    13. Don Johnson, Alfred Menezes,  and Scott Vanstone, “The Elliptic Curve Digital Signature Algorithm (ECDSA) ,” International Journal of Information Security,pp.36-63,2001
    14. N. Koblitz, A. Menezes, and S. Vanstone,” The State of Elliptic Curve Cryptography,” Designs, Codes and Cryptography, vol.19, pp.173–193, 2000
    15. S. Micali, K. Ohta, and L. Reyzin, “Accountable-subgroup Multisignatures (Extended Abstract),” In Proceedings of CCS 2001, ACM Press, pp.245-254, 2001
    16. K. Nayak, S. Kumar, A. Miller, and E. Shi, “Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack,” IEEE European Symposium on Security and Privacy, vol.142,no.5, 2016
    17. S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,”, 2009
    18. S. Noether, “Ring Signature Confidential Transactions,”,2015
    19. C. Rackoff and D. R. Simon, “Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack,” Cryptology - CRYPT0 ’91, LNCS 576, pp. 433-444, 1992
    20. R. L. Rivest, A. Shamir, and L. M. Adleman. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, vol.21,no.2, pp.120–126, 1978
    21. R. L Rivest, A Shamir, and Y Tauman, “How to Leak a Secret: Theory and Applications of Ring Signatures,” In Theoretical Computer Science, pp.164-186,2006
    22. E. B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza, “Zerocash: Decentralized Anonymous Payments from Bitcoin,” IEEE Syposium on Security and Privacy, pp.459-474,2014
    23. A. Sapirshtein, Y. Sompolinsky, and A. Zohar, “Optimal Selfish Mining Strategies in Bitcoin,” International Conference on Financial Cryptography and Data Security, Springer, Berlin, Heidelberg, pp.515-532, 2016



      Please note : You will need Adobe Acrobat viewer to view the full articles.Get Free Adobe Reader

      This site uses encryption for transmitting your passwords.