Adaptive zero-knowledge proofs and adaptively secure oblivious transfer

Journal of Cryptology

Volumn 24, Issue 4, 2011, Pages 761-799

  Lindell, Yehuda ^a   Zarosim, Hila ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Adaptive security; Black box separations; Minimal assumptions; Oblivious transfer; Zero knowledge proofs

Indexed keywords

ADAPTIVE SECURITY; BLACK BOXES; MINIMAL ASSUMPTIONS; OBLIVIOUS TRANSFER; ZERO KNOWLEDGE PROOF;

SEPARATION;

EID: 80053052012     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-010-9072-z     Document Type: Article

References (41)

1. D. Beaver, Adaptive zero knowledge and computational equivocation, in 28th STOC (1996), pp. 629-638
2. D. Beaver, Plug and play encryption, in Advances in Cryptology-Crypto '97 (1997), pp. 75-89
3. D. Beaver, Adaptively secure oblivious transfer, in ASIACRYPT'98. LNCS, vol. 1514 (Springer, Berlin, 1998), pp. 300-314 (Pubitemid 128151428)
4. M. Bellare, S. Micali, R. Ostrovsky, Perfect zero-knowledge in constant rounds, in 22nd STOC (1990), pp. 482-493 (Pubitemid 20729154)
5. M. Blum, How to prove a theorem so no one else can claim it, in Proceedings of the International Congress of Mathematicians, USA, pp. 1444-1451
6. R. Canetti 2000 Security and composition of multiparty cryptographic protocols J. Cryptol. 13 1 143 202 1732900 0957.68040 10.1007/s001459910006
7. R. Canetti, M. Fischlin, Universally composable commitments, in CRYPTO 2001. LNCS, vol. 2139 (Springer, Berlin, 2001), pp. 19-40 (Pubitemid 33317906)
8. R. Canetti, U. Feige, O. Goldreich, M. Naor, Adaptively secure multiparty computation, in Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (1996), pp. 639-648
9. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party computation, in 34th STOC (2002), pp. 494-503. Full version available at http://eprint.iacr.org/2002/140 (Pubitemid 35009410)
10. Y. Chang, C. Hsiao, C. Lu, On the impossibilities of basing one-way permutations on central cryptographic primitives, in ASIACRYPT 2002 (2002), pp. 110-124
11. J.S. Coron, J. Patarin, Y. Seurin, The random oracle model and the ideal cipher model are equivalent, in CRYPTO 2008. LNCS, vol. 5157 (Springer, Berlin, 2008), pp. 1-20
12. I. Damgård, On the existence of bit commitment schemes and zero-knowledge proofs, in Proc. CRYPTO '89 (1989), pp. 17-27
13. I. Damgård, Interactive hashing can simplify zero-knowledge protocol design without computational assumptions, in Proc. CRYPTO '93 (1993), pp. 100-109
14. I. Damgård, J.B. Nielsen, Improved non-committing encryption schemes based on a general complexity assumption, in CRYPTO '00 (2000), pp. 432-450
15. S. Even O. Goldreich A. Lempel 1985 A randomized protocol for signing contracts Commun. ACM 28 6 637 647 800680 10.1145/3812.3818 (Pubitemid 15569164)
16. U. Feige, A. Shamir, Zero knowledge proofs of knowledge in two rounds, in CRYPTO'89. LNCS, vol. 435 (Springer, Berlin, 1989), pp. 526-544
17. M. Fischlin, On the impossibility of constructing NonInteractive StatisticallySecret protocols from any trapdoor OneWay function, in Cryptographers' Track-RSA 2002. LNCS, vol. 2271 (Springer, Berlin, 2002), pp. 79-95
18. R. Gennaro Y. Gertner J. Katz L. Trevisan 2005 Bounds on the efficiency of generic cryptographic constructions SIAM J. Comput. 35 1 217 246 2178807 1087.94019 10.1137/S0097539704443276
19. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, M. Viswanathan, The relationship between public key encryption and oblivious transfer, in The 41st FOCS (2000), pp. 325-335 (Pubitemid 32075902)
20. Y. Gertner, T. Malkin, O. Reingold, On the impossibility of basing trapdoor functions on trapdoor predicates, in The 42nd FOCS (2001), pp. 126-135 (Pubitemid 33068373)
21. Y. Gertner, T. Malkin, S. Myers, Towards a separation of semantic and CCA security for public key encryption, in The 4th TCC. LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 434-455
22. O. Goldreich Kahan 1996 How to construct constant-round zero-knowledge proof systems for NP J. Cryptol. 9 3 167 190 1403496 0855.68085 10.1007/s001459900010
23. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications (Cambridge University Press, Cambridge, 2004)
24. O. Goldreich S. Micali A. Wigderson 1991 Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems J. ACM 38 1 691 729 1125927 0799.68101
25. C. Hazay, Y. Lindell, Efficient Secure Two-Party Protocols (Springer, Berlin, 2010)
26. R. Impagliazzo, M. Luby, One-way functions are essential for complexity based cryptography, in The 30th FOCS (1989), pp. 230-235 (Pubitemid 20725952)
27. R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations, in 21st STOC (1989), pp. 44-61
28. T. Itoh Y. Ohta H. Shizuya 1997 A language-dependent cryptographic primitive J. Cryptol. 10 1 37 49 1427410 0864.94018 10.1007/s001459900018 (Pubitemid 127754562)
29. B. Kapron, L. Malka, V. Srinivasan, A characterization of non-interactive instance-dependent commitment-schemes (NIC), in Proc. ICALP 2007 (2007), pp. 328-339
30. J. Kahn, M. Saks, C. Smyth, A dual version of Reimer's inequality and a proof of Rudich's conjecture, in Proceedings of the 15th Annual IEEE Conference on Computational Complexity, July 04-07, 2000, p. 98
31. J.H. Kim, D.R. Simon, P. Tetali, Limits on the efficiency of one-way permutation-based hash functions, in The 40th FOCS (1999), pp. 535-542 (Pubitemid 129306195)
32. M. Luby C. Rackoff 1988 How to construct pseudorandom permutations from pseudorandom functions SIAM J. Comput. 17 2 373 386 935346 0644.94018 10.1137/0217022
33. D. Micciancio, S. Vadhan, Statistical zero-knowledge proofs with efficient provers: lattice problems and more, in CRYPTO 2003. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 282-298 (Pubitemid 137636948)
34. D. Micciancio, S.J. Ong, A. Sahai, S. Vadhan, Concurrent zero knowledge without complexity assumptions, in TCC 2006. LNCS, vol. 3876 (Springer, Berlin, 2006), pp. 1-20 (Pubitemid 43979841)
35. M. Naor 1991 Bit commitment using pseudorandomness J. Cryptol. 4 2 151 158 0731.68033 10.1007/BF00196774
36. M.H. Nguyen, S. Vadhan, Zero knowledge with ecient provers, in Proc. 38th STOC (2006), pp. 287-295
37. S.J. Ong, S. Vadhan, An equivalence between zero knowledge and commitments, in The 5th TCC. LNCS, vol. 4948 (Springer, Berlin, 2008), pp. 482-500
38. S. Rudich, The use of interaction in public cryptosystems (Extended Abstract), in CRYPTO 91 (1991), pp. 242-251
39. O. Reingold, L. Trevisan, S.P. Vadhan, Notions of reducibility between cryptographic primitives, in The 1st TCC. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 1-20
40. D.R. Simon, Finding collisions on a one-way street: Can secure Hash functions be based on general assumptions? in EUROCRYPT 1998. LNCS, vol. 1403 (Springer, Berlin, 1998), pp. 334-345 (Pubitemid 128081496)
41. S.P. Vadhan, An unconditional study of computational zero knowledge, in The 45th FOCS (2004), pp. 176-185 (Pubitemid 40575279)