Short signature and universal designated verifier signature without random oracles

Lecture Notes in Computer Science

Volumn 3531, Issue , 2005, Pages 483-498

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

^a UNIVERSITY OF TOKYO   (Japan)

^b NEC CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; NETWORKS (CIRCUITS);

PUBLIC KEY ATTACKS; RANDOM ORACLES; SECURITY DEFINITIONS; UNIVERSAL DESIGNATED VERIFIER SIGNATURE (UDVS);

SECURITY OF DATA;

EID: 26444589650     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496137_33     Document Type: Conference Paper

References (16)

1. J.H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Eurocrypt'02, volume 2332 of LNCS, pages 83-107, Springer-Verlag, 2002.
2. M. Bellare and A. Palacio. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols. In CRYPTO '04, volume 3152. Springer-Verlag, 2004.
3. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In ACM Conference on Computer and Communication Security, volume 62-73, 1993.
4. D. Boneh and X. Boyen. Short Signatures Without Random Oracles. In Eurocrypt'04, volume 3027 of LNCS, pages 56-73. Springer-Verlag, 2004.
5. D. Boneh, B. Lynn, and H. Shacham. Short Signatures from the Weil Pairing. In Asiacrypt'01, volume 2248 of LNCS, pages 514-532. Springer-Verlag, 2001.
6. R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Methodology, Revisited. In STOC'98, pages 209-218. ACM Press, 1998.
7. R. Cramer and V. Shoup. Signature Schemes Based on the Strong RSA Assumption. ACM Transactions on Information and System Security, 3(3):161-185, 2000.
8. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problem. In Crypto'86, volume 263 of LNCS, pages 186-194. Springer-Verlag, 1987.
9. R. Gennaro, S. Halevi, and T. Rabin. Secure Hash-and-Sign Signatures without the Random Oracle. In Eurocrypt'99, volume 1592 of LNCS, pages 123-139. Springer-Verlag, 1999.
10. S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., 17(2):281-308, 1988.
11. S. Hada and T. Tanaka. On the Existence of 3-round Zero-Knowledge Protocols. In CRYPTO '98, LNCS, pages 408-423, 1998.
12. M. Jakobsson, K. Sako, and R. Impagliazzo. Designated Verifier Proofs and Their Applications. In Eurocrypt'96, volume 1070 of LNCS, pages 143-154. Springer-Verlag, 1996.
13. A. Joux and K. Nguyen. Separating Decisional Diffie-Hellman from Diffie-Hellman in Cryptographic Groups. Cryptology ePrint Archive, Report 2001/003, http://eprint.iacr.org/2001/003/, 2001.
14. S. Mitsunari, R. Sakai, and M. Kasahara. A New Trator Tracing. IEICE Trans. Fundamentals, E85A(2):481-484, 2002.
15. R. Steinfeld, L. Bull, H. Wang, and J. Pieprzyk. Universal designated-verifier signatures. In Asiacrypt'03, volume 2894 of LNCS, pages 523-542. Springer-Verlag, 2003.
16. R. Steinfeld, H. Wang, and J. Pieprzyk. Efficient Extension of Standard Schnorr/RSA Signatures into Universal Designated-Verifier Signatures. In PKC'04, volume 2947 of LNCS, pages 86-100. Springer-Verlag, 2004.