Secure two-party computation via cut-and-choose oblivious transfer

Journal of Cryptology

Volumn 25, Issue 4, 2012, Pages 680-722

  Lindell, Yehuda ^a   Pinkas, Benny ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Concrete efficiency; Cut and choose; Malicious adversaries; Secure two party computation

Indexed keywords

CONCRETE ANALYSIS; CUT-AND-CHOOSE; EFFICIENT CONSTRUCTION; MALICIOUS ADVERSARIES; OBLIVIOUS TRANSFER; SECURE TWO-PARTY COMPUTATIONS; SECURITY PROPERTIES; TWO-PARTY COMPUTATION;

COMPUTER APPLICATIONS; CRYPTOGRAPHY;

COMPUTATION THEORY;

EID: 84869506354     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-011-9107-0     Document Type: Article

References (41)

1. Y. Aumann, Y. Lindell, Security against covert adversaries: Efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281-343 (2010)
2. D. Beaver, Foundations of secure interactive computing, in CRYPTO'91. LNCS, vol. 576(Springer, Berlin, 1991), pp. 377-391
3. R. Canetti, Security and composition of multi-party cryptographic protocols. J. Cryptol. 13(1), 143-202 (2000)
4. R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in 42nd FOCS (2001), pp. 136-145. Full version available at http://eprint.iacr.org/2000/067
5. R. Canetti, M. Fischlin, Universally composable commitments, in CRYPTO 2001. LNCS, vol. 2139(Springer, Berlin, 2001), pp. 19-40
6. L. Carter, M. N. Wegman, Universal classes of Hash functions. J. Comput. Syst. Sci. 18(2), 143-154 (1979)
7. R. Cramer, I. Damgård, B. Schoenmakers, Proofs of partial knowledge and simplified design of Witness hiding protocols, in CRYPTO'94. LNCS, vol. 839(Springer, Berlin, 1994), pp. 174-187
8. I. Damgård, On Sigma; protocols. http://www.daimi.au.dk/~ivan/ Sigma.pdf
9. Y. Dodis, R. Gennaro, J. Hastad, H. Krawczyk, T. Rabin, Randomness extraction and key derivation using the CBC, cascade and HMAC modes, in CRYPTO 2004. LNCS, vol. 3152(Springer, Berlin, 2004), pp. 494-510
10. Y. Dodis, V. Shoup, S. Walfish, Efficient constructions of composable commitments and zero-knowledge proofs, in CRYPTO 2008. LNCS, vol. 5157(Springer, Berlin, 2008), pp. 515-535
11. S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647 (1985)
12. J. Garay, P. MacKenzie, K. Yang. Strengthening zero-knowledge protocols using signatures, in EUROCRYPT 2003. LNCS, vol. 2656(Springer, Berlin, 2003), pp. 177-194
13. O. Goldreich, Foundations of Cryptography: Volume 2-Basic Applications (Cambridge University Press, Cambridge, 2004)
14. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game-A completeness theorem for protocols with honest majority, in 19th STOC (1987), pp. 218-229. For details see [13, Chap. 7]
15. S. Goldwasser, L. Levin, Fair computation of general functions in presence of immoral majority, in CRYPTO'90. LNCS, vol. 537(Spring, Berlin, 1990), pp. 77-93
16. V. Goyal, P. Mohassel, A. Smith. Efficient two party and multi party computation against covert adversaries, in EUROCRYPT2008. LNCS, vol. 4965(Springer, Berlin, 2008), pp. 289-306
17. R. L. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd edn. (Addison-Wesley, Reading, 1998)
18. J. Hastad, R. Impagliazzo, L. Levin, M. Luby, Construction of a pseudo-random generator from any one-way function. SIAM J. Comput. 28(4), 1364-1396 (1999)
19. C. Hazay, Y. Lindell, Efficient Secure Two-Party Protocols: Techniques and Constructions (Springer, Berlin, 2010)
20. C. Hazay, K. Nissim, Efficient set operations in the presence of malicious adversaries, in PKC 2010. LNCS, vol. 6056(Springer, Berlin, 2010), pp. 312-331
21. Y. Ishai, M. Prabhakaran, A. Sahai, Founding cryptography on oblivious transfer-Efficiently, in CRYPTO 2008. LNCS, vol. 5157(Springer, Berlin, 2008), pp. 572-591
22. Y. Ishai, M. Prabhakaran, A. Sahai, Secure arithmetic computation with no honest majority, in TCC 2009. LNCS, vol. 5444(Springer, Berlin, 2009), pp. 294-314
23. S. Jarecki, V. Shmatikov, Efficient two-party secure computation on committed inputs, in EUROCRYPT 2007. LNCS, vol. 4515(Springer, Berlin, 2007), pp. 97-114
24. M. Kiraz, B. Schoenmakers, A protocol issue for the malicious case of Yao's garbled circuit construction, in Proceedings of the 27th Symposium on Information Theory in the Benelux (2006), pp. 283-290
25. V. Kolesnikov, T. Schneider, Improved garbled circuit: Free XOR gates and applications, in 35th ICALP. LNCS, vol. 5126(Springer, Berlin, 2008), pp. 486-498
26. Y. Lindell, Parallel coin-tossing and constant-round secure two-party computation. J. Cryptol. 16(3), 143-184 (2003)
27. Y. Lindell, Highly-efficient universally-composable commitments, in EUROCRYPT 2011. LNCS, vol. 6632(Springer, Berlin, 2011), pp. 446-466
28. Y. Lindell, B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, in EUROCRYPT2007. LNCS, vol. 4515(Springer, Berlin, 2007), pp. 52-78
29. Y. Lindell, B. Pinkas, A proof of Yao's protocol for secure two-party computation. J. Cryptol. 22(2), 161-188 (2009)
30. P. MacKenzie, K. Yang, On simulation-sound trapdoor commitments, in EUROCRYPT 2004. LNCS, vol. 3027(Springer, Berlin, 2004), pp. 382-400
31. A. J. Menezes, PC. van Oorschot, SA. Vanstone, Handbook of Applied Cryptography (CRC Press, Boca Raton, 2001)
32. S. Micali, P. Rogaway, Secure computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, LNCS, vol. 576(Springer, Berlin, 1991), pp. 392-404
33. P. Mohassel, M. K. Franklin, Efficiency tradeoffs for malicious two-party computation, in 9th PKC Conference. LNCS, vol. 3958(Springer, Berlin, 2006), pp. 458-473
34. M. Naor, O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, in 36th FOCS (1995), pp. 170-181
35. J. B. Nielsen, C. Orlandi, LEGO for two-party secure computation, in TCC 2009. LNCS, vol. 5444(Springer, Berlin, 2009), pp. 368-386
36. C. Orlandi, Personal communication, 2010
37. C. Peikert, V. Vaikuntanathan, B. Waters, A framework for efficient and composable oblivious transfer, in CRYPTO'08. LNCS, vol. 5157(Springer, Berlin, 2008), pp. 554-571
38. B. Pinkas, T. Schneider, N. P. Smart, S. C. Williams. Secure two-party computation is practical, in ASI-ACRYPT 2009. LNCS, vol. 5912(Springer, Berlin, 2009), pp. 250-267
39. M. Rabin, How to exchange secrets by oblivious transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard U., 1981
40. A. Shamir, How to share a secret. Commun. ACM 22(11), 612-613 (1979)
41. A. C. Yao, How to generate and exchange secrets, in 27th FOCS (1986), pp. 162-167