Randomization techniques for secure computation

Cryptology and Information Security Series

Volumn 10, Issue , 2013, Pages 222-248

  Ishai, Yuval ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GARBLED CIRCUITS; RANDOMIZATION TECHNIQUES; SECURE COMPUTATION; STATE OF THE ART;

CRYPTOGRAPHY;

EID: 84888171349     PISSN: 18716431     EISSN: 18798101     Source Type: Book Series    
DOI: 10.3233/978-1-61499-169-4-222     Document Type: Article

References (66)

1. [AIK06a] Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. Computationally private randomizing polynomials and their applications. Computational Complexity, 15(2):115-162, 2006. Preliminary version in CCC 2005. (Pubitemid 43938398)
2. 0. SIAM J. Comput., 36(4):845-888, 2006. Preliminary version in FOCS 2004. (Pubitemid 47246873)
3. [AIK09] Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. Cryptography with constant input locality. J. Cryptology, 22(4):429-469, 2009. Preliminary version in Crypo 2007.
4. [AIK10a] Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. Cryptography by cellular automata or how fast can complexity emerge in nature? In ICS, pages 1-19, 2010.
5. [AIK10b] Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. In ICALP (1), pages 152-163, 2010.
6. [AIK11] Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz. How to garble arithmetic circuits. In FOCS, pages 120-129, 2011. Full version in ECCC 19: 58 (2012).
7. [AIKW12] Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, and Brent Waters. Encoding functions with constant online rate, or: Garbling circuits with short input keys. Manuscript, 2012.
8. [AIR01] William Aiello, Yuval Ishai, and Omer Reingold. Priced oblivious transfer: How to sell digital goods. In EUROCRYPT, pages 119-135, 2001. (Pubitemid 33275828)
9. [App11a] Benny Applebaum. Key-dependent message security: Generic amplification and completeness theorems. In EUROCRYPT, 2011.
10. [App11b] Benny Applebaum. Randomly encoding functions: A new cryptographic paradigm (invited talk). In ICITS, pages 25-31, 2011.
11. 1. In Proc. 18th STOC, pages 1-5, 1986.
12. [BC92] Michael Ben-Or and Richard Cleve. Computing algebraic formulas using a constant number of registers. SIAM J. Comput., 21(1):54-58, 1992.
13. [BGW88] Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pages 1-10, 1988.
14. [BHHI10] Boaz Barak, Iftach Haitner, Dennis Hofheinz, and Yuval Ishai. Bounded keydependent message security. In EUROCRYPT, pages 423-444, 2010.
15. [BHR12a] Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. Adaptively secure garbling with applications to one-time programs and secure outsourcing. IACR Cryptology ePrint Archive, 2012:564, 2012. To appear in Asiacrypt 2012.
16. [BHR12b] Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. Foundations of garbled circuits. IACR Cryptology ePrint Archive, 2012:265, 2012. To appear in ACM CCS 2012.
17. [BMR90] Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols (extended abstract). In STOC, pages 503-513, 1990. (Pubitemid 20729156)
18. [Bre74] Richard P. Brent. The parallel evaluation of general arithmetic expressions. J. ACM, 21(2):201-206, 1974.
19. [Can00] Ran Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
20. [Can01] Ran Canetti. Universally composable security: A new paradigm for cryptographic protocols. Electronic Colloquium on Computational Complexity (ECCC) TR01-016, 2001. Preliminary version in FOCS 2001.
21. [CCD88] David Chaum, Claude Crépeau, and Ivan Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. of 20th STOC, pages 11-19, 1988.
22. [CCKM00] Christian Cachin, Jan Camenisch, Joe Kilian, and Joy Müller. One-round secure computation and secure autonomous mobile agents. In ICALP, pages 512-523, 2000.
23. [CFGN96] Ran Canetti, Uriel Feige, Oded Goldreich, and Moni Naor. Adaptively secure multi-party computation. In STOC, pages 639-648, 1996.
24. [CFIK03] Ronald Cramer, Serge Fehr, Yuval Ishai, and Eyal Kushilevitz. Efficient multi-party computation over rings. In EUROCRYPT, pages 596-613, 2003.
25. [Cle90] Richard Cleve. Towards optimal simulations of formulas by bounded-width programs. In STOC, pages 271-277, 1990. (Pubitemid 20729131)
26. [DGRV11] Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, and Salil P. Vadhan. On approximating the entropy of polynomial mappings. In ICS, pages 460-475, 2011.
27. [DPSZ12] Ivan Damgård, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. Multiparty computation from somewhat homomorphic encryption. In CRYPTO, pages 643-662, 2012.
28. [EGL85] Shimon Even, Oded Goldreich, and Abraham Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6):637-647, 1985.
29. [FKN94] Uri Feige, Joe Kilian, and Moni Naor. A minimal model for secure computation. In STOC, 1994.
30. [Gen09] Craig Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
31. [GGH+07] Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, and Guy N. Rothblum. Verifying and decoding in constant depth. In STOC, pages 440-449, 2007. (Pubitemid 47630763)
32. [GGH+08] Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, and Guy N. Rothblum. A (de)constructive approach to program checking. In STOC, pages 143-152, 2008.
33. [GGP10] Rosario Gennaro, Craig Gentry, and Bryan Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In CRYPTO, 2010.
34. [GHV10] Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan. i-hop homomorphic encryption and rerandomizable Yao circuits. In CRYPTO, pages 155-172, 2010.
35. [GIS+10] Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, and Akshay Wadia. Founding cryptography on tamper-proof hardware tokens. In TCC, pages 308-326, 2010.
36. [GKR08] Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. One-time programs. In CRYPTO, pages 39-56, 2008.
37. [GMW87] Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play ANY mental game. In STOC, pages 218-229, 1987.
38. [Gol04] Oded Goldreich. Foundations of Cryptography: Basic Applications. Cambridge University Press, 2004.
39. [GS12] Sanjam Garg and Amit Sahai. Adaptively secure multi-party computation with dishonest majority. In CRYPTO, pages 105-123, 2012.
40. [GVW12] Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee. Functional encryption with bounded collusions via multi-party computation. In CRYPTO, pages 162-179, 2012.
41. [HILL99] Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
42. [HK07] Omer Horvitz and Jonathan Katz. Universally-composable two-party computation in two rounds. In CRYPTO, pages 111-129, 2007.
43. [HRV10] Iftach Haitner, Omer Reingold, and Salil P. Vadhan. Efficiency improvements in constructing pseudorandom generators from one-way functions. In STOC, pages 437-446, 2010.
44. [IK97] Yuval Ishai and Eyal Kushilevitz. Private simultaneous messages protocols with applications. In ISTCS, pages 174-184, 1997.
45. [IK00] Yuval Ishai and Eyal Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In FOCS, pages 294-304, 2000. (Pubitemid 32075899)
46. [IK02] Yuval Ishai and Eyal Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In ICALP, pages 244-256, 2002.
47. [IKO+11] Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, and Amit Sahai. Efficient non-interactive secure computation. In EUROCRYPT, pages 406-425, 2011.
48. [IKP10] Yuval Ishai, Eyal Kushilevitz, and Anat Paskin. Secure multiparty computation with minimal interaction. In CRYPTO, pages 577-594, 2010.
49. [IKP12] Yuval Ishai, Eyal Kushilevitz, and Anat Paskin-Cherniavsky. From randomizing polynomials to parallel algorithms. In ITCS, pages 76-89, 2012.
50. [IPS08] Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. Founding cryptography on oblivious transfer-efficiently. In CRYPTO, pages 572-591, 2008.
51. [IPS09] Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. Secure arithmetic computation with no honest majority. In TCC, pages 294-314, 2009.
52. [Kil88] J. Kilian. Founding cryptography on oblivious transfer. In STOC, pages 20-31, 1988.
53. [Kol05] Vladimir Kolesnikov. Gate evaluation secret sharing and secure one-round twoparty computation. In ASIACRYPT, pages 136-155, 2005. (Pubitemid 43763473)
54. [LP09] Yehuda Lindell and Benny Pinkas. A proof of Yao's protocol for secure two-party computation. J. Cryptology, 22(2):161-188, 2009.
55. [NP01] Moni Naor and Benny Pinkas. Efficient oblivious transfer protocols. In SODA, pages 448-457, 2001.
56. [NP06] Moni Naor and Benny Pinkas. Oblivious polynomial evaluation. SIAM J. Comput., 35(5):1254-1281, 2006. Preliminary version in STOC 1999. (Pubitemid 44599926)
57. [NPS99] Moni Naor, Benny Pinkas, and Reuban Sumner. Privacy preserving auctions and mechanism design. In ACM Conference on Electronic Commerce, pages 129-139, 1999.
58. [Per92] R. Perlata. On the distribution of quadratic residues and nonresidues modulo a prime number. Mathematics of Computation, 58:433-440, 1992.
59. [PVW08] Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554-571, 2008.
60. [Rab81] M. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
61. [RAD78] Ronald L. Rivest, Leonard M. Adleman, and Michael Dertouzos. On data banks and privacy homomorphisms. Foundations of secure computation, 4(11):169-180, 1978.
62. [Raz89] Alexander A. Razborov. On the method of approximations. In STOC, pages 167-176, 1989.
63. [Smo87] Roman Smolensky. Algebraic methods in the theory of lower bounds for boolean circuit complexity. In STOC, pages 77-82, 1987. (Pubitemid 18643393)
64. [SS10] Amit Sahai and Hakan Seyalioglu. Worry-free encryption: functional encryption with public keys. In ACM Conference on Computer and Communications Security, pages 463-472, 2010.
65. [SYY99] Tomas Sander, Adam Young, and Moti Yung. Non-interactive cryptocomputing for NC1. In FOCS, pages 554-567, 1999.
66. [Yao86] Andrew Chi-Chih Yao. How to generate and exchange secrets. In FOCS, pages 162-167, 1986.