Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles

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

Volumn 4450 LNCS, Issue , 2007, Pages 201-216

  Bellare, Mihir ^a   Shoup, Sarah ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; MATHEMATICAL MODELS;

COMPUTATIONAL COST; HASH FUNCTION; IDENTIFICATION PROTOCOLS; RANDOM ORACLES; TWO TIER SIGNATURES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 38049024484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_14     Document Type: Conference Paper

References (38)

1. M. Abdalla, J. H. An, M. Bellare, and C. Namprempre. From identification to signatures via the Fiat-Shamir transform: Minimizing assumptions for security and forward-security. In EUROCRYPT 2002, volume 2332 of LNCS. Springer-Verlag.
2. M. Bellare, C. Namprempre, and G. Neven. Security proofs for identity-based identification and signature schemes. In EUROCRYPT 2004, volume 3027 of LNCS. Springer-Verlag.
3. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme. Journal of Cryptology, 16(3):185-215, 2003.
4. M. Bellare and A. Palacio. GQ and Schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In CRYPTO 2002, volume 2442 of LNCS. Springer-Verlag.
5. M. Bellare and S. Shoup. Two-tier signatures, strongly unforgeable signatures, and fiat-shamir without random oracles. Full version of current paper. Available from authors' web pages.
6. D. Bleichenbacher and U. Maurer. On the efficiency of one-time digital signatures. In ASIACRYPT'96, volume 1163 of LNCS. Springer-Verlag.
7. D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In CRYPTO 2004, volume 3152 of LNCS. Springer-Verlag.
8. D. Boneh, E. Shen, and B. Waters. Strongly unforgeable signatures based on computational diffie-hellman. In PKC 2006, volume 3958 of LNCS. Springer-Verlag.
9. R. Canetti, S. Halevi, and J. Katz. Chosen-ciphertext security from identity-based encryption. In EUROCRYPT 2004, volume 3027 of LNCS. Springer-Verlag.
10. J. C. Cha and J. H. Cheon. An identity-based signature from gap Diffie-Hellman groups. In PKC 2003, volume 2567 of LNCS. Springer-Verlag.
11. R. Cramer and I. Damgård. Secure signature schemes based on interactive protocols. In CRYPTO'95, volume 963 of LNCS. Springer-Verlag.
12. W. Dai. Crypto++ Library, http://www.cryptopp.com/
13. Y. Dodis and J. Katz. Chosen-ciphertext security of multiple encryption. In TCC 2005, volume 3378 of LNCS. Springer-Verlag.
14. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
15. S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. Journal of Cryptology, 9(1):35-67, 1996.
16. U. Feige, A. Fiat, and A. Shamir. Zero knowledge proofs of identity. Journal of Cryptology, 1(2):77-94, 1988.
17. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In 22nd ACM STOC, 1990. ACM Press.
18. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In CRYPTO'86, volume 263 of LNCS. Springer-Verlag.
19. O. Goldreich. Foundations of Cryptography: Basic Applications, volume 2. Cambridge University Press, Cambridge, UK, 2004.
20. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal on Computing, 25(1):169-192, Feb. 1996.
21. S. Goldwasser and Y. T. Kalai. On the (in)security of the Fiat-Shamir paradigm. In 44th FOCS, 2003. IEEE Computer Society Press.
22. S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, Apr. 1988.
23. L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In EUROCRYPT'88, volume 330 of LNCS. Springer-Verlag.
24. L. C. Guillou and J.-J. Quisquater. A "paradoxical" indentity-based signature scheme resulting from zero-knowledge. In CRYPTO'88, volume 403 of LNCS. Springer-Verlag.
25. F. Hess. Efficient identity based signature schemes based on pairings. In SAC 2002, volume 2595 of LNCS. Springer-Verlag.
26. Q. Huang, D. S. Wong, and Y. Zhaoe. Generic transformation to strongly unforgeable signatures. Cryptology ePrint Archive, Report 2006/346, 2006. http ://eprint.iacr.org/2006/346.
27. Y. Lindell. A simpler construction of cca2-secure public-key encryption under general assumptions. Journal of Cryptology, 19(3):359-377, 2006.
28. S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. In ACM CCS 01, 2001. ACM Press.
29. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st ACM STOC, 1989. ACM Press.
30. K. Ohta and T. Okamoto. On concrete security treatment of signatures derived from identification. In CRYPTO'98, volume 1462 of LNCS. Springer-Verlag.
31. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In CRYPTO'92, volume 740 of LNCS. Springer-Verlag.
32. D. Pointcheval and J. Stern. Security proofs for signature schemes. In EURO-CRYPT'96, volume 1070 of LNCS. Springer-Verlag.
33. D. Pointcheval and J. Stern. Security arguments for digital signatures and blind signatures. Journal of Cryptology, 13(3):361-396, 2000.
34. J. Rompel. One-way functions are necessary and sufficient for secure signatures. In 22nd ACM STOC, 1990. ACM Press.
35. C.-P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
36. A. Shamir. Identity-based cryptosystems and signature schemes. In CRYPTO'84, volume 196 of LNCS. Springer-Verlag.
37. I. Teranishi, T. Oyama, and W. Ogata. General conversion for obtaining strongly existentially unforgeable signatures. In INDOCRYPT 2006, LNCS.
38. B. R. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005, volume 3494 of LNCS.