An efficient group signature scheme from bilinear maps

Lecture Notes in Computer Science

Volumn 3574, Issue , 2005, Pages 455-467

  Furukawa, Jun ^a,b   Imai, Hideki ^b  

^a NEC CORPORATION   (Japan)

^b INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; RELATIONAL DATABASE SYSTEMS;

DIFFIE-HELLMAN ASSUMPTION; GROUP SIGNATURE SCHEME; RANDOM ORACLES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 26444446884     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506157_38     Document Type: Conference Paper

References (31)

1. G. Ateniese, J. Camenisch, M. Joye, G. Tsudik: A Practical and Provable Secure Coalition-Resistant Group Signature Scheme. CRYPTO 2000, LNCS 1880, pp.255-270.
2. G. Ateniese, B. de Medeiros: Efficient Group Signatures without Trapdoors. ASI-ACRYPT 2003, LNCS 2894, pp.246-268.
3. Niko Bari, Birgit Pfitzmann: Collision-Free Accumulators and Fail-Stop Signature Schemes without Trees. EUROCRYPT 1997: 480-494.
4. Mihir Bellare, Haixia Shi, Chong Zhang: Foundations of Group Signatures: The Case of Dynamic Groups. CT-RSA 2005: 136-153
5. M. Bellare, D. Micciancio, B. Warinschi: Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003, LNCS 2656, pp. 614-629.
6. Dan Boneh, Xavier Boyen: Short Signatures Without Random Oracles. EURO-CRYPT 2004: 56-73.
7. Dan Boneh, Xavier Boyen, Hovav Shacham: Short Group Signature. CRYPTO 2004, Lecture Notes in Computer Science 3152, pp. 41-55, 2004, Springer.
8. Jan Camenisch, Jens Groth: Group Signatures: Better Efficiency and New Theoretical Aspects. Security in Communication Networks - SCN 2004, LNCS series.
9. Jan Camenisch, Anna Lysyanskaya: A Signature Scheme with Efficient Protocols. SCN 2002: 268-289.
10. Jan Camenisch, Anna Lysyanskaya: Signature Schemes and Anonymous Credentials from Bilinear Maps. Crypto 2004, Springer Verlag, 2004.
11. J. Camenisch, M. Michels: A group signature scheme based on an RSA-variant. Technical Report RS-98-27, BRIGS, University of Aarhus, November 1998. An earlier version appears in ASIACRYPT '98.
12. J. Camenisch, M. Stadler: Efficient Group Signature Schemes for Large Groups. CRYPTO '97, LNCS 1296, pp. 410-424.
13. D. Chaum, E. van Heyst: Group Signatures. EUROCRYPT '91, LNCS 547, pp. 257-265.
14. Cynthia Dwork, Moni Naor, Amit Sahai: Concurrent Zero-Knowledge. STOC 1998: 409-418.
15. Jun Furukawa, Hideki Imai: Efficient Group Signature Scheme from Bilinear Maps (with appendixes). Available from the first author via e-mail.
16. Jun Furukawa, Shoko Yonezawa: Group Signatures with Separate and Distributed Authorities. Fourth Conference on Security in Communication Networks '04 (SCN04), 2004.
17. Tetsuya Izu, Tsuyoshi Takagi: Efficient Computations of the Tate Pairingfor the Large MOV Degrees. ICISC 2002: 283-297.
18. Aggelos Kiayias, Moti Yung: Group Signatures: Provable Security, Efficient Constructions and Anonymity from Trapdoor-Holders. Cryptology ePrint Archieve, Report 2004/076.
19. A. Kiayias, Y. Tsiounis, M. Yung: Traceable Signatures. EUROCRYPT 2004, LNCS 3027, pp. 571-589.
20. Joe Kilian, Erez Petrank: Identity Escrow. CRYPTO 1998: 169-185.
21. Seungjoo Kim, Sung Jun Park, Dongho Won: Convertible Group Signatures. ASI-ACRYPT 1996: 311-321.
22. Anna Lysyanskaya, Ronald L. Rivest, Amit Sahai, Stefan Wolf: Pseudonym Systems. Selected Areas in Cryptography 1999: 184-199.
23. A. Menezes, C. van Oorschot, S. Vanstone: Handbook of Applied Cryptography, CRC Press, pp. 617-627, (1997).
24. Daniele Micciancio, Erez Petrank: Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol. Electronic Colloquium on Computational Complexity (ECCC) (045): (2002).
25. S. Mitsunari, R. Sakai, M. Kasahara: A new Traitor tracing. IEICE Trans. Fundamentals, E85-A(2), pp.481-484, Feb. 2002.
26. Atsuko Miyaji, Masaki Nakabayashi, Shunzou Takano: New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. E85-A(2), pp. 481-484, 2002.
27. Lan Nguyen, Rei Safavi-Naini: Efficient and Provably Secure Trapdoor-free Group Signature Schemes from Bilinear Pairings. Asiacrypt 2004. pp. 372-386.
28. Moni Naor, Moti Yung: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. STOC 1990: 427-437.
29. D. Pointcheval, J. Stern: Security Arguments for Digital Signatures and Blind Signatures. J. Cryptology 13(3): 361-396 (2000).
30. Michael Scott, Paulo S.L.M Barreto: Generating more MNT elliptic curves. Cryptology ePrint Archieve, Report 2004/058.
31. Claus-Peter Schnorr, Markus Jakobsson: Security of Signed ElGamal Encryption. ASIACRYPT 2000: 73-89.