ID-based deniable ring authentication with constant-size signature

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.

References

1. Naor M Deniablering authenticationIn: Proceedings of Crypto2002BerlinSpringer-Verlag, LNCS 2442 2002 481498
2. Susilo W Mu Y Non-interactive deniable ringauthenticationIn: Proceedings of ICISC2003BerlinSpringer-Verlag, LNCS 2971 2004 386401
3. Susilo W Mu Y Deniable ring authenticationrevisitedIn: Proceedings of ACNS 2004BerlinSpringer-Verlag,LNCS 3089 2004 149163
4. Rivest R Shamir A Tauman Y How to leak a secretIn: Proceedingsof Asiacrypt 2001BerlinSpringer-Verlag, LNCS 2248 2001 552565
5. Zhang F G Kim K ID-based blind signature andring signature from pairingsIn: Proceedingsof Asiacrypt 2002BerlinSpringer-Verlag, LNCS 2501 2002 533547
6. Shamir A Identity-basedcryptosystems and signature schemesIn: Proceedings of Crypto 1984BerlinSpringer-Verlag, LNCS 196 1984 4753
7. Benaloh J Mare M D One-way accumulators: a decentralizedalternative to digital signaturesIn: Proceedingsof EUROCRYPT 1993BerlinSpringer-Verlag, LNCS 765 1993 274285
8. Baric N Pfitzmann B Collision-free accumulatorsand fail-stop signature schemes without treesIn: Proceedings of EUROCRYPT 1997BerlinSpringer-Verlag, LNCS 1233 1997 480494
9. Goodrich M T Tamassia R An efficient dynamic and distributedcryptographic accumulatorIn: Proceedingsof ISC 2002BerlinSpringer-Verlag, LNCS 2433 2002 372388
10. Camenisch J Lysyanskaya A Dynamic accumulators and applicationto efficient revocation of anonymous credentialsIn: Proceedings of CRYPTO 2002BerlinSpringer-Verlag, LNCS 2442 2002 6176
11. Nguyen L Accumulatorfrom bilinear pairings and application to ID-based ring signaturesand group membership revocationIn: Proceedingsof CT-RSA 2005BerlinSpringer-Verlag, LNCS 3376 2005 275292
12. Dodis Y Kiayias A Nicolosi A et al.Anonymous identification in Ad Hoc GroupsIn: Proceedings of EUROCRYPT 2004BerlinSpringer-Verlag,LNCS 3027 2004 609626
13. Zhang F G Safavi-Naini R Susilo W ID-based chameleon hashes from bilinear pairingshttp://eprint.iacr.org/2003/208
14. Dutta R Barua R Sarkar P Pairing-based cryptographic protocols: a surveyhttp://eprint.iacr.org/2004/064.pdf
15. Maas M Pairing-basedcryptographyMaster thesis by Departmentof Mathematics and Computing Science, Technische University Eindhoven 2004
16. Pointcheval D Stern J Security proofs for signatureschemesIn: Proceedings of Eurocrypt 2006BerlinSpringer-Verlag,LNCS 1070 1996 387398
17. Ma C G Yang Y X Transferable off-line electroniccashChinese Journal of Computers 2005 28(3)301308
18. Ma C G Yang Y X Hu Z M A fair electronic check systems with reusable refundACTA Electronic Sinica 2005 33(9)15621566
19. Zhang G Y Wang L L Ma C G Survey on transitive signature schemesChinese Journal of Computer Science 2007 34(1)611