Ring signatures without random oracles

Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06

Volumn 2006, Issue , 2006, Pages 297-302

  Chow, Sherman S M ^a   Wei, Victor K ^b   Liu, Joseph K ^c   Yuen, Tsz Hon ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Bilinear pairings; Random oracle model; Ring signature

Indexed keywords

AUTHENTICATION; COMPUTATIONAL METHODS; COMPUTER CRIME; COMPUTER OPERATING SYSTEMS; SECURITY OF DATA;

BILINEAR PAIRINGS; ORACLE MODELS; RING SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33845246483     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1128817.1128861     Document Type: Conference Paper

References (25)

1. M. Abe, M. Ohkubo, and K. Suzuki. 1-out-of-n Signatures from a Variety of Keys. In Y. Zheng, editor, Advances in Cryptology - ASIA CRYPT 2002, Proceedings, volume 2501 of Lecture Notes in Computer Science, pages 415-432. Springer, 2002.
2. M. Bellare, A. Boldyreva, and A. Palacio. An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science, pages 171-188. Springer, 2004.
3. M. Bellare, D. Micciancio, and B. Warinschi. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. In E. Biham, editor, Advanaes in Cryptology - EUROCRYPT 2003, Proceedings, volume 2656 of Lecture Notes in Computer Science, pages 614-629. Springer, 2003.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proc. 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
5. A. Bender, J. Katz, arid R. Morselli. Ring Signatures: Stronger Definitions, and Constructions without Random Oracles. To appear in TCC 06. Cryptology ePrint Archive, Report 2005/304, 2005.
6. D. Boneh and X. Boyen. Short signatures without random oracles. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science, pages 56-73. Springer, 2004.
7. D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In E. Biham, editor, Advances in Cryptology - EUROCRYPT 2003, Proceedings, volume 2656 of Lecture Notes in Computer Science, pages 416-432. Springer, 2003.
8. D. Boneh, B. Lynn, and H. Shacham. Short Signat-ures from the Weil Pairing. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, Proceedings, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer, 2001.
9. E. Bresson, J. Stern, and M. Szydlo. Threshold Ring Signatures arid Applications to Ad-hoc Groups. In M. Yurig, editor, Advances in Cryptology - CRYPTO 2002, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 465-480. Springer, 2002.
10. J. Camenisch and M. Stadler. Efficient Group Signature Schemes for Large Groups (Extended Abstract). In B. S. K. Jr., editor, Advances in Cryptology - CRYPTO '97, Proceedings, volume 1294 of Lecture Notes in Computer Science, pages 410-424. Springer, 1997.
11. R. Canetti, O. Goldreich, arid S. Halevi. The Random Oracle Methodology, Revisited. In STOC, pages 209-218, 1998.
12. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, Proceedings, volume 547 of Lecture Notes in Computer Science, pages 257-265. Springer, 1991.
13. S. Chow, L. Hui, and S. Yiu. Identity Based Threshold Ring Signature. In Information Security and Cryptology - ICISC 2004, Revised Papers, volume 3506 of Lecture Notes in Computer Science, pages 218-232, Seoul, Korea, 2004. Springer-Verlag. Also available at Cryptology ePrint Archive, Report 2004/179.
14. S. Chow, S. Yiu, and L. Hui. Efficient Identity Based Ring Signature . In Applied Cryptography and Network Security, Third International Conference, ACNS 2005, Proceedings, volume 3531 of Lecture Notes in Computer Science, pages 499-512. Springer-Verlag, 2005. Also available at Cryptology ePrint Archive, Report 2004/327.
15. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. In Y. Desmedt, editor, Advances in Cryptology - CRYPTO '94, Proceedings, volume 839 of Lecture Notes in Computer Science, pages 174-187. Springer, 1994.
16. Y. Dodis, A. Kiayias, A. Nicolosi, and V. Shoup. Anonymous Identification in Ad Hoc Groups. In C. Cachin and J. Cameriisch, editors, Advances in Cryptology - EUROCRYPT 2004, Proceedings, volume 3027 of Lecture Notes in Computer Science, pages 609-626. Springer, 2004.
17. J. Groth, R. Ostrovsky, and A. Sahai. Perfect Non-Interactive Zero Knowledge for NP. Cryptology ePrint Archive, Report 2005/290, 2005.
18. F. Laguillaumie and D. Vergnaud. Multi-designated Verifiers Signatures. In J. Lopez, S. Qing, and E. Okamoto, editors, Information and Communications Security, 6th International Conference, ICICS 2004, Proceedings, volume 3269 of Lecture Notes in Computer Science, pages 495-507. Springer-Verlag, 2004.
19. R. L. Rivest, A. Shamir, and Y. Tauman. How to Leak a Secret. In C. Boyd, editor, Advances in Cryptology - ASIA CRYPT 2001, Proceedings, volume 2248 of Lecture Notes in Computer Science, pages 552-565. Springer, 2001.
20. W. Susilo and Y. Mu. Non-Interactive Deniable Ring Authentication. In J. I. Lim and D. H. Lee, editors, Information Security and Cryptology - ICISC 2003, Revised Papers, volume 2971 of Lecture Notes in Computer Science, pages 386-401. Springer-Verlag, 2004.
21. W. Susilo, Y. Mu, and F. Zhang. Perfect Concurrent Signature Schemes. In J. Lopez, S. Qing, and E. Okamoto, editors, Information and Communications Security, 6th International Conference, ICICS 2004, Proceedings, volume 3269 of Lecture Notes in Computer Science, pages 14-26. Springer-Verlag, Oct. 2004.
22. V. K. Wei. Tight Reductions among Strong Diffie-Hellman Assumptions. Cryptology ePrint Archive, Report 2005/057, 2005.
23. J. Xu, Z. Zhang, and D. Feng. A Ring Signature Scheme Using Bilinear Pairings. In C. H. Lim and M. Yung, editors, Information Security Applications, 5th International Workshop, WISA 2004, Revised Papers, volume 3325 of Lecture Notes in Computer Science, pages 163-172. Springer-Verlag, 2004.
24. F. Zhang and K. Kim. ID-Based Blind Signature and Ring Signature from Pairings. In Y. Zheng, editor, Advances in Cryptology - ASIA CRYPT 2002, Proceedings, volume 2501 of Lecture Notes in Computer Science, pages 533-547. Springer, 2002.
25. F. Zhang, R. Safavi-Naini, and W. Susilo. An Efficient Signature Scheme from Bilinear Pairings and Its Application. In F. Bao, R. H. Deng, and J. Zhou, editors, Public Key Cryptography - PKC 2004, Proceedings, volume 2947 of Lecture, Notes in Computer Science, pages 277-290. Springer, 2004.