Short traceable signatures based on bilinear pairings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4266 LNCS, Issue , 2006, Pages 88-103

  Choi, Seung Geol ^a   Park, Kunsoo ^b   Yung, Moti ^a  

^a Fu Foundation School of Engineering and Applied Science   (United States)

^b Seoul National University   (South Korea)

Author keywords

Anonymity; Bilinear pairings; Cryptographic protocols; Group signatures; Traceable signatures

Indexed keywords

CRYPTOGRAPHY; DATA STRUCTURES; DECISION THEORY; MATHEMATICAL MODELS; SECURITY OF DATA;

BILINEAR PAIRINGS; CRYPTOGRAPHIC PROTOCOLS; GROUP SIGNATURES; TRACEABLE SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33845243601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11908739_7     Document Type: Conference Paper

References (19)

1. M. Abdalla, J. An, M. Bellare, and C. Namprepre. From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security. EUROCRYPT 2002, LNCS, Springer.
2. G. Ateniese, J. Camenisch, S. Hohenberger, and B. Medeiros. Practical Group Signatures without Random Oracles. Cryptology ePrint Archive, Report 2005/385, http://eprint.iacr.org/.
3. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. Crypto 2000, LNCS, Springer.
4. D. Boneh, X. Boyen. Short Signatures Without Random Oracles. EUROCRYPT 2004, LNCS, Springer.
5. D. Boneh, X. Boyen, and H. Shacham. Short Group Signatures. Crypto 2004, LNCS, Springer.
6. D. Boneh, B. Lynn, and H.Shacham. Short signatures from Weil pairing. Asiacrypt 2001. LNCS, Springer.
7. M. Bellare, D. Micciancio, and B.Warinshci. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. EUROCRYPT 2003, LNCS, Springer.
8. M. Bellare, H. Shi, C. Zhang. Foundations of group signatures: The case of dynamic groups. Cryptology ePrint Archive, Report 2004/077, http://eprint.iacr.org/.
9. X. Boyen and B. Waters. Compact Group Signatures Without Random Oracles. Cryptology ePrint Archive, Report 2005/381, http://eprint.iacr.org/.
10. J. Camenisch. Efficient and generalized group signatures. EUROCRYPT 1997, LNCS, Springer.
11. D. Chaum and E. van Heyst. Group signatures. EUROCRYPT 1991, LNCS, Springer.
12. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. Crypto 1986, LNCS, Springer.
13. A. Kiayias, Y. Tsiounis, and M. Yung. Traceable Signatures. EUROCRYPT 2004, LJVCS, Springer.
14. A. Kiayias and M. Yung. Group signatures: Efficient constructions and annymity from trapdoor-holders. Cryptology ePrint Archive, Report 2004/076. http://eprint.iacr.org/.
15. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, E84-A(5):1234-43, May 2001.
16. L. Nguyen and R. Safavi-Naini. Efficient and Provably Secure Trapdoor-free Group Signatures Schemes from Bilinear Pairings. Asiacrypt 2004, LNCS, Springer.
17. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
18. K. Rubin and A. Silverberg. Supersingular Abelian varieties in Cryptology. Crypto 2002. LNCS, Springer.
19. C. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3): 161-174, 1991.