Toward the fair anonymous signatures: Deniable ring signatures

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

Volumn 3960 LNCS, Issue , 2006, Pages 174-191

  Komano, Yuichi ^a   Ohta, Kazuo ^b   Shimbo, Atsushi ^a   Kawamura, Shinichi ^a  

^a TOSHIBA CORPORATION   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

CDH; DDH; DLP; Group signatures; Random oracle model; Ring signatures

Indexed keywords

ELECTRONIC DOCUMENT EXCHANGE; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MANAGERS; NETWORK SECURITY;

CDH; DDH; DLP; GROUP SIGNATURES; RANDOM ORACLE MODEL; RING SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; AUTHENTICATION;

DECISION DIFFIE-HELLMAN; GROUP MANAGERS; GROUP SIGNATURE SCHEME; GROUP SIGNATURES; RANDOM ORACLE MODEL; RING SIGNATURE SCHEMES; RING SIGNATURES; SIGNATURE SCHEME;

EID: 33745675937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605805_12     Document Type: Conference Paper

References (17)

1. M. Abdalla and B. Warinschi. On the minimal assumptions of group signature schemes. In L. Lopez, S. Qing, and E. Okamoto, editors, The 2004 International Conference on Information and Communications Security - ICICS 2004, volume 3269 of Lecture Notes in Computer Science, pages 1-13, Berlin, Heidelberg, New York, 2004. Springer-Verlag.
2. M. Abe, M. Ohkubo, and K. Suzuki. l-out-of-n signatures from a variety of keys. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences, E87-A (1):131-140, 2004.
3. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Advances in Cryptology - CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 255-270, Berlin, Heidelberg, New York, 2000. Springer-Verlag.
4. 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, Advances in Cryptology - EUROCRYPT 2003, volume 2656 of Lecture Notes in Computer Science, pages 614-629, Berlin, Heidel-berg, New York, 2003. Springer-Verlag.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols,. In Proc. of the First ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
6. M. Bellare, H. Shi, and C. Zhang. Foundations of group signatures: The case of dynamic groups. In A. Menezes, editor, Topics in Cryptography - CT-RSA 2005, volume 3376 of Lecture Notes in Computer Science, pages 136-153, Berlin, Heidelberg, New York, 2005. Springer-Verlag.
7. D. Boneh. The decision diffie-hellman problem. In J. Buhler, editor, Algorithmic Number Theory, Third International Symposium - ANTS-III, volume 1423 of Lecture Notes in Computer Science, pages 48-63, Berlin, Heidelberg, New York, 1998. Springer-Verlag.
8. J. Camenisch and J. Groth. Group signatures: Better efficiency and new theoretical aspect. In C. Blundo and S. Cimato, editors, SCN '04, volume 3352 of Lecture Notes in Computer Science, pages 120-133, Berlin, Heidelberg, New York, 2005. Springer-Verlag.
9. D. Chaum. Zero-knowledge undeniable signatures. In I. Damgård, editor, Advances in Cryptology - EUROCRYPT'90, volume 473 of Lecture Notes in Computer Science, pages 458-464, Berlin, Heidelberg, New York, 1991. Springer-Verlag.
10. D. Chaum and P. Pedersen. Wallet databeses with observers. In E. F. Brickell, editor, Advances in Cryptology - CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 89-105, Berlin, Heidelberg, New York, 1993. Springer-Verlag.
11. D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, editor, Advances in Cryptology - EuroCrypt '91, pages 257-265, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 547.
12. 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, volume 893 of Lecture Notes in Computer Science, pages 174-187, Berlin, Heidelberg, New York, 1995. Springer-Verlag.
13. M. Naor. Deniable ring authentication. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 481-498, Berlin, Heidelberg, New York, 2002. Springer-Verlag.
14. W. Ogata, K. Kurosawa, and S.-H. Heng. The security of the fdh variant of chaum's undeniable signature scheme. In S. Vaudenay, editor, Public Key Cryptography -PKC 2005, volume 3386 of Lecture Notes in Computer Science, pages 328-345, Berlin, Heidelberg, New York, 2005. Springer-Verlag.
15. T. Okamoto and D. Pointcheval. The gap-problems: A new class of problems for the security of cryptographic schemes. In K. Kim, editor, Public Key Cryptography - PKC 2001, volume 1992 of Lecture Notes in Computer Science, pages 104-118, Berlin, Heidelberg, New York, 2001. Springer-Verlag.
16. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
17. R. L. Rivest, A. Shamir, and Y. Tauman. How to leak a secret. In C. Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 526-565, Berlin, Heidelberg, New York, 2001. Springer-Verlag.