Multi-trapdoor commitments and their applications to proofs of knowledge secure under concurrent man-in-the-middle attacks

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

Volumn 3152, Issue , 2004, Pages 220-236

  Gennaro, Rosario ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM COMPILERS;

COMMON REFERENCE STRING MODELS; DIFFIE-HELLMAN ASSUMPTION; IDENTIFICATION PROTOCOL; MAN IN THE MIDDLE ATTACKS; ROUND COMPLEXITY; STRONG DIFFIE-HELLMAN; STRONG RSA ASSUMPTION; TRAPDOOR COMMITMENTS;

MOBILE SECURITY;

EID: 26444461753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_14     Document Type: Article

References (37)

1. E. Bach and J. Shallit. Algorithmic Number Theory - Volume 1. MIT Press, 1996.
2. nd IEEE Symp. on Foundations of Computer Science (FOCS'01), pp.106-115, 2001.
3. rd IEEE Symp. on Foundations of Computer Science (FOCS'02), pp.345-355, 2001.
4. N. Barić, and B. Pfitzmann. Collision-free accumulators and Fail-stop signature schemes without trees. Proc. of EUROCRYPT'97 (LNCS 1233), pp.480-494, Springer 1997.
5. M. Bellare, M. Fischlin, S. Goldwasser and S. Micali. Identification Protocols Secure against Reset Attacks. Proc. of EUROCRYPT'01 (LNCS 2045), pp.495-511, Springer 2001.
6. M. Bellare and O. Goldreich. On defining proofs of knowledge. Proc. of CRYPTO'92 (LNCS 740), Springer 1993.
7. D. Bleichenbacher and U. Maurer. Optimal Tree-Based One-time Digital Signature Schemes. STACS'96, LNCS, Vol. 1046, pp.363-374, Springer-Verlag.
8. D. Bleichenbacher and U. Maurer. On the efficiency of one-time digital signatures. Proc. of ASIACRYPT96 (LNCS 1163), pp.145-158, Springer 1996.
9. D. Boneh and X. Boyen. Short Signatures without Random Oracles. Proc. of EUROCRYPT'04 (LNCS 3027), pp.382-400, Springer 2004.
10. D. Boneh and M. Franklin. Identity-Based Encryption from the Weill Pairing. SIAM J. Comp. 32(3):586-615, 2003.
11. nd IEEE Symp. on Foundations of Computer Science (FOCS'01), pp.136-145, 2001.
12. R. Canetti and M. Fischlin. Universally Composable Commitments. Proc. of CRYPTO'01 (LNCS 2139), pp.19-40, Springer 2001.
13. rd ACM Symp. on Theory of Computing (STOC'01), pp.570-579, 2001.
14. R. Cramer and I. Damgård. New Generation of Secure and Practical RSA-based signatures. Proc. of Crypto '96 LNCS no. 1109, pages 173-185.
15. th ACM Conference on Computer and Communication Security 1999.
16. I. Damgård. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. Proc. of EUROCYPT'OO (LNCS 1807), pp.174-187, Springer 2000.
17. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano and A. Sahai. Robust Non-Interactive Zero Knowledge. Proc. of CRYPTO'01, (LNCS 2139), pp.566-598, Springer 2001.
18. Y. Dodis, R. Gennaro, J. Håstad, H. krawczyk and T. Rabin. Randomness Extraction and Key Derivation using the CBC, Cascade and HMAC Modes. This proceedings.
19. D. Dolev, C. Dwork and M. Naor. Non-malleable Cryptography. SIAM J. Comp. 30(2):391-437, 2000.
20. th ACM Symp. on Theory of Computing (STOC'98), pp.409-418, 1998.
21. U. Feige, A. Fiat and A. Shamir. Zero-Knowledge Proofs of Identity. J. of Crypt. 1(2):77-94, Springer 1988.
22. J. Garay, P. MacKenzie and K. Yang. Strengthening Zero-Knowledge Protocols Using Signatures, Proc. of EUROCRYPT'03 (LNCS 2656), pp.177-194, Springer 2003. Final version at eprint.iacr.org
23. R. Gennaro, S. Halevi and T. Rabin. Secure Hash-and-Sign Signatures Without the Random Oracle. Proc. of Eurocrypt '99 LNCS no. 1592, pages 123-139.
24. S. Goldwasser, S. Micali, and G. Rackoff. The knowledge complexity of interactive proof-systems. SIAM. J. Computing, 18(1):186-208, February 1989.
25. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Computing, 17(2):281-308, April 1988.
26. L.C. Guillou and J.J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessors Minimizing both Transmission and Memory. Proc. of EUROCRYPT'88 (LNCS 330), pp.123-128, Springer 1989.
27. J. Katz. Efficient and Non-Malleable Proofs of Plaintext Knowledge and Applications. Proc. of EURO CRYPT'03 (LNCS 2656), pp.211-228, Springer 2003.
28. L. Lamport. Constructing Digital Signatures from a One-Way Function. Technical Report SRI Intl. CSL 98, 1979.
29. Y. Lindell. Composition of Secure Multi-Party Protocols. Lecture Notes in Computer Science vol.2815, Springer 2003.
30. Y. Lindell. Lower Bounds for Concurrent Self Composition. Proc of the 1st Theory of Cryptography Conference (TCC'04), LNCS 2951, pp.203-222, Springer 2004.
31. P. MacKenzie and K. Yang. On Simulation-Sound Trapdoor Commitments. Proc. of EUROCRYPT'04 (LNCS 3027), pp.382-400, Springer 2004.
32. U. Maurer. Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters. J. of Crypt. 8(3):123-156, Springer 1995.
33. T. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Crypto '91, pages 129-140, 1991. LNCS No. 576.
34. rd IEEE Symp. on Foundations of Computer Science (FOCS'02), pp.366-375, 2002.
35. R. Rivest, A. Shamir and L. Adelman. A Method for Obtaining Digital Signature and Public Key Cryptosystems. Comm. of ACM, 21 (1978), pp. 120-126
36. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4:161-174, 1991.
37. A. Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Trans, on Computer Systems, 1(1), 1983, pages 38-44.