Skip to main content
SpringerLink
Log in

ID-based deniable ring authentication with constant-size signature

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Deniable ring authentication allows a member of an ad-hoc sunset of participants to authenticate a message without revealing which member has issued the signature, and the verifier cannot transfer the signature to any third party. It is an important cryptographic primitive for privacy and anonymous communication. Unfortunately, the size of the signature of the proposed deniable ring authentication is dependent on the size of the ring. It is inefficient especially when the size of the ring is large. In this paper, we propose an ID-based version of deniable ring authentication. We present a generic construction which uses dynamic accumulators to construct ID-based deniable ring authentication with constant-size signature. We also give an ID-based deniable ring authentication based on bilinear pairings, which is proved to be secure in the random oracle model.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Naor M. Deniable ring authentication. In: Proceedings of Crypto 2002. Berlin: Springer-Verlag, LNCS 2442, 2002, 481–498

    Google Scholar 

  2. Susilo W, Mu Y. Non-interactive deniable ring authentication. In: Proceedings of ICISC 2003. Berlin: Springer-Verlag, LNCS 2971, 2004, 386–401

    Google Scholar 

  3. Susilo W, Mu Y. Deniable ring authentication revisited. In: Proceedings of ACNS 2004. Berlin: Springer-Verlag, LNCS 3089, 2004, 149–163

    Google Scholar 

  4. Rivest R, Shamir A, Tauman Y. How to leak a secret. In: Proceedings of Asiacrypt 2001. Berlin: Springer-Verlag, LNCS 2248, 2001, 552–565

    Chapter  Google Scholar 

  5. Zhang F G, Kim K. ID-based blind signature and ring signature from pairings. In: Proceedings of Asiacrypt 2002. Berlin: Springer-Verlag, LNCS 2501, 2002, 533–547

    Chapter  Google Scholar 

  6. Shamir A. Identity-based cryptosystems and signature schemes. In: Proceedings of Crypto 1984. Berlin: Springer-Verlag, LNCS 196, 1984, 47–53

    Google Scholar 

  7. Benaloh J, Mare M D. One-way accumulators: a decentralized alternative to digital signatures. In: Proceedings of EUROCRYPT 1993. Berlin: Springer-Verlag, LNCS 765, 1993, 274–285

    Google Scholar 

  8. Baric N, Pfitzmann B. Collision-free accumulators and failstop signature schemes without trees. In: Proceedings of EUROCRYPT 1997. Berlin: Springer-Verlag, LNCS 1233, 1997, 480–494

    Google Scholar 

  9. Goodrich MT, Tamassia R. An efficient dynamic and distributed cryptographic accumulator. In: Proceedings of ISC 2002. Berlin: Springer-Verlag, LNCS 2433, 2002, 372–388

    Google Scholar 

  10. Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Proceedings of CRYPTO 2002. Berlin: Springer-Verlag, LNCS 2442, 2002, 61–76

    Google Scholar 

  11. Nguyen L. Accumulator from bilinear pairings and application to ID-based ring signatures and group membership revocation. In: Proceedings of CT-RSA 2005. Berlin: Springer-Verlag, LNCS 3376, 2005, 275–292

    Google Scholar 

  12. Dodis Y, Kiayias A, Nicolosi A, et al. Anonymous identification in Ad Hoc Groups. In: Proceedings of EUROCRYPT 2004. Berlin: Springer-Verlag, LNCS 3027, 2004, 609–626

    Google Scholar 

  13. Zhang F G, Safavi-Naini R, Susilo W. ID-based chameleon hashes from bilinear pairings. http://eprint.iacr.org/2003/208

  14. Dutta R, Barua R, Sarkar P. Pairing-based cryptographic protocols: a survey. http://eprint.iacr.org/2004/064.pdf

  15. Maas M. Pairing-based cryptography. Master thesis by Department of Mathematics and Computing Science, Technische University Eindhoven, 2004

  16. Pointcheval D, Stern J. Security proofs for signature schemes. In: Proceedings of Eurocrypt 2006. Berlin: Springer-Verlag, LNCS 1070, 1996, 387–398

    Google Scholar 

  17. Ma C G, Yang Y X. Transferable off-line electronic cash. Chinese Journal of Computers, 2005, 28(3): 301–308

    Google Scholar 

  18. Ma C G, Yang Y X, Hu Z M. A fair electronic check systems with reusable refund. ACTA Electronic Sinica, 2005, 33(9): 1562–1566

    Google Scholar 

  19. Zhang G Y, Wang L L, Ma C G. Survey on transitive signature schemes. Chinese Journal of Computer Science, 2007, 34(1): 6–11

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Harbin Engineering University, Harbin, 150001, China

    Lingling Wang, Guoyin Zhang & Chunguang Ma

Authors
  1. Lingling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guoyin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chunguang Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lingling Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, L., Zhang, G. & Ma, C. ID-based deniable ring authentication with constant-size signature. Front. Comput. Sci. China 2, 106–112 (2008). https://doi.org/10.1007/s11704-008-0003-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-008-0003-1

Keywords

Search

Navigation