Foundations of garbled circuits

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2012, Pages 784-796

  Bellare, Mihir ^a   Hoang, Viet Tung ^b   Rogaway, Phillip ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Garbled circuits; Garbling schemes; Provable security; Secure function evaluation; Yao's protocol

Indexed keywords

CRYPTOGRAPHIC TECHNIQUES; GARBLED CIRCUITS; GARBLING SCHEMES; HIGHER-LEVEL PROTOCOLS; MULTIPLE SECURITIES; PROVABLE SECURITY; RIGOROUS ANALYSIS; SECURE FUNCTION EVALUATION;

AUTOMATA THEORY; CRYPTOGRAPHY;

SECURITY OF DATA;

EID: 84869382999     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2382196.2382279     Document Type: Conference Paper

References (51)

1. M. Abadi and J. Feigenbaum. Secure circuit evaluation. Journal of Cryptology, 2(1):1-12, 1990.
2. B. Applebaum. Key-dependent message security: Generic amplification and completeness. EUROCRYPT 2011, volume 6632 of LNCS, pages 527-546. Springer, 2011.
3. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. Computational Complexity, 15(2):115-162, 2006.
4. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC0. SIAM J. Comput., 36(4):845-888, 2006.
5. B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. ICALP 2010, Part I, volume 6198 of LNCS, pages 152-163. Springer, 2010.
6. B. Applebaum, Y. Ishai, and E. Kushilevitz. How to garble arithmetic circuits. 52nd FOCS, pages 120-129. IEEE Computer Society Press, 2011.
7. Y. Aumann and Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. TCC 2007, volume 4392 of LNCS, pages 137-156. Springer, 2007.
8. B. Barak, I. Haitner, D. Hofheinz, and Y. Ishai. Bounded key-dependent message security. EUROCRYPT 2010, volume 6110 of LNCS, pages 423-444. Springer, 2010.
9. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi, and T. Schneider. Secure evaluation of private linear branching programs with medical applications. ESORICS 2009, volume 5789 of LNCS, pages 424-439. Springer, 2009.
10. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 503-513. ACM, 1990.
11. M. Bellare, V. Hoang, and P. Rogaway. Foundations of garbled circuits. Cryptology ePrint Archive, Report 2012/265, 2012.
12. M. Bellare and P. Rogaway. The security of triple encryption and a framework for code-based game-playing proofs. EUROCRYPT 2006, volume 4004 of LNCS, pages 409-426. Springer, 2006.
13. C. Cachin, J. Camenisch, J. Kilian, and J. Müller. One-round secure computation and secure autonomous mobile agents. 27th Intl. Colloquium on Automata, Languages, and Programming - ICALP 2000, pages 512-523. Springer, 2000.
14. M. Chase and S. Kamara. Structured encryption and controlled disclosure. ASIACRYPT 2010, volume 6477 of LNCS, pages 577-594. Springer, 2010.
15. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation (extended abstract). 26th ACM STOC, pages 554-563. ACM Press, 1994.
16. K. Frikken, M. Atallah, and C. Zhang. Privacy-preserving credit checking. Proceedings of the 6th ACM conference on Electronic commerce, pages 147-154. ACM, 2005.
17. R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. CRYPTO 2010, volume 6223 of LNCS, pages 465-482. Springer, 2010.
18. O. Goldreich. Cryptography and cryptographic protocols. Manuscript, 2001.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. 19th ACM STOC, pages 218-229. ACM Press, 1987.
20. S. Goldwasser, Y. Kalai, and G. Rothblum. One-time programs. CRYPTO 2008, volume 5157 of LNCS, pages 39-56. Springer, 2008.
21. V. Goyal, P. Mohassel, and A. Smith. Efficient two party and multi party computation against covert adversaries. EUROCRYPT 2008, volume 4965 of LNCS, pages 289-306. Springer, 2008.
22. A. Herzberg and H. Shulman. Secure guaranteed computation. Cryptology ePrint Archive, Report 2010/449, 2010.
23. Y. Huang, D. Evans, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. USENIX Security Symposium, 2011.
24. Y. Huang, C. Shen, D. Evans, J. Katz, and A. Shelat. Efficient secure computation with garbled circuits. ICISS, volume 7093 of Lecture Notes in Computer Science, pages 28-48. Springer, 2011.
25. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. 41st FOCS, pages 294-304. IEEE Computer Society Press, 2000.
26. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. ICALP, volume 2380 of Lecture Notes in Computer Science, pages 244-256. Springer, 2002.
27. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Cryptography with constant computational overhead. 40th ACM STOC, pages 433-442. ACM Press, 2008.
28. S. Kamara, P. Mohassel, and M. Raykova. Outsourcing multi-party computation. Cryptology ePrint report 2011/272, 2011.
29. S. Kamara and L. Wei. Special-purpose garbled circuits. Unpublished manuscript.
30. J. Katz and R. Ostrovsky. Round-optimal secure two-party computation. CRYPTO 2004, volume 3152 of LNCS, pages 335-354. Springer, 2004.
31. V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. ICALP 2008, Part II, volume 5126 of LNCS, pages 486-498. Springer, 2008.
32. B. Kreuter, A. Shelat, and C. Shen. Billion-gate secure computation with malicious adversaries. Proceedings of the 21th USENIX Security Symposium (USENIX 2012), 2012.
33. L. Kruger, S. Jha, E. Goh, and D. Boneh. Secure function evaluation with ordered binary decision diagrams. ACM CCS 06, pages 410-420. ACM Press, 2006.
34. Y. Lindell and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. EUROCRYPT 2007, volume 4515 of LNCS, pages 52-78. Springer, 2007.
35. Y. Lindell and B. Pinkas. A proof of security of Yao's protocol for two-party computation. Journal of Cryptology, 22(2):161-188, 2009.
36. Y. Lindell and B. Pinkas. Secure two-party computation via cut-and-choose oblivious transfer. TCC 2011, volume 6597 of LNCS, pages 329-346. Springer, 2011.
37. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. Proceedings of the 13th conference on USENIX Security Symposium-Volume 13, pages 20-20. USENIX Association, 2004.
38. P. Mohassel and M. Franklin. Efficiency tradeoffs for malicious two-party computation. PKC 2006, volume 3958 of LNCS, pages 458-473. Springer, 2006.
39. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. 33rd ACM STOC, pages 590-599. ACM Press, 2001.
40. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. Proceedings of the 1st ACM conference on Electronic commerce, pages 129-139. ACM, 1999.
41. A. Paus, A. Sadeghi, and T. Schneider. Practical secure evaluation of semi-private functions. ACNS 09, volume 5536 of LNCS, pages 89-106. Springer, 2009.
42. K. Pietrzak. A leakage-resilient mode of operation. EUROCRYPT 2009, volume 5479 of LNCS, pages 462-482. Springer, 2009.
43. B. Pinkas. Cryptographic techniques for privacy-preserving data mining. ACM SIGKDD Explorations Newsletter, 4(2):12-19, 2002.
44. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure two-party computation is practical. ASIACRYPT 2009, volume 5912 of LNCS, pages 250-267. Springer, 2009.
45. P. Rogaway. The round complexity of secure protocols. MIT Ph.D. Thesis, 1991.
46. A. Sahai and H. Seyalioglu. Worry-free encryption: functional encryption with public keys. ACM CCS 10, pages 463-472. ACM Press, 2010.
47. T. Schneider. Engineering Secure Two-Party Computation Protocols - Advances in Design, Optimization, and Applications of Efficient Secure Function Evaluation. PhD thesis, Ruhr-University Bochum, Germany, February 9, 2011. http://thomaschneider.de/papers/S11Thesis.pdf.
48. T. Schneider. Engineering Secure Two-Party Computation Protocols. Springer, Berlin Heidelberg, 2012.
49. J. R. Troncoso-Pastoriza, S. Katzenbeisser, and M. Celik. Privacy preserving error resilient dna searching through oblivious automata. ACM CCS 07, pages 519-528. ACM Press, 2007.
50. A. Yao. How to generate and exchange secrets. Foundations of Computer Science, 1986., 27th Annual Symposium on, pages 162-167. IEEE, 1986.
51. A. C. Yao. Protocols for secure computations. 23rd FOCS, pages 160-164. IEEE Computer Society Press, 1982.