How to garble arithmetic circuits

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 120-129

  Applebaum, Benny ^a   Ishai, Yuval ^b   Kushilevitz, Eyal ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Cryptography; Garbled Circuit; Randomizing Polynomials

Indexed keywords

AFFINE FUNCTION; ARITHMETIC CIRCUIT; BOOLEAN CIRCUIT; GARBLED CIRCUITS; INTEGER VECTORS; OTHER APPLICATIONS; RANDOMIZING POLYNOMIALS; SECURE COMPUTATION;

COMPUTER SCIENCE; CRYPTOGRAPHY; INTEGRATING CIRCUITS; LOGIC CIRCUITS;

AFFINE TRANSFORMS;

EID: 84863309994     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.40     Document Type: Conference Paper

References (41)

1. B. Applebaum, "Key-dependent message security: Generic amplification and completeness," in EUROCRYPT, 2011.
2. B. Applebaum, D. Cash, C. Peikert, and A. Sahai, "Fast cryptographic primitives and circular-secure encryption based on hard learning problems," in CRYPTO, 2009.
3. B. Applebaum, Y. Ishai, and E. Kushilevitz, "Computationally private randomizing polynomials and their applications," Computational Complexity, vol. 15, no. 2, pp. 115-162, 2006. (Pubitemid 43938398)
4. 0," SIAM J. Comput., vol. 36, no. 4, pp. 845-888, 2006.
5. -, "Cryptography with constant input locality," J. Cryptology, vol. 22, no. 4, pp. 429-469, 2009.
6. -, "From secrecy to soundness: Efficient verification via secure computation," in ICALP (1), 2010.
7. B. Barak, I. Haitner, D. Hofheinz, and Y. Ishai, "Bounded key-dependent message security," in EUROCRYPT, 2010.
8. D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols (extended abstract)," in STOC, 1990.
9. M. Blum and S. Micali, "How to generate cryptographically strong sequences of pseudorandom bits," SICOMP, vol. 13, no. 4, pp. 162-167, 1984.
10. Z. Brakerski and V. Vaikuntanathan, "Efficient Fully Homomorphic Encryption from (Standard) LWE," in FOCS, 2011.
11. C. Cachin, J. Camenisch, J. Kilian, and J. Müller, "One-round secure computation and secure autonomous mobile agents," in ICALP, 2000.
12. R. Cleve, "Towards optimal simulations of formulas by bounded-width programs," in STOC, 1990.
13. R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz, "Efficient multi-party computation over rings," in EUROCRYPT, 2003.
14. U. Feige, J. Kilian, and M. Naor, "A minimal model for secure computation," in STOC, 1994.
15. R. Gennaro, C. Gentry, and B. Parno, "Non-interactive verifiable computing: Outsourcing computation to untrusted workers," in CRYPTO, 2010.
16. C. Gentry, "Fully homomorphic encryption using ideal lattices," in STOC, 2009.
17. C. Gentry and S. Halevi, "Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits," in FOCS, 2011.
18. O. Goldreich, S. Micali, and A. Wigderson, "How to play ANY mental game," in STOC, 1987.
19. S. Goldwasser, Y. T. Kalai, and G. N. Rothblum, "Delegating computation: interactive proofs for muggles," in STOC, 2008.
20. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, "A pseudorandom generator from any one-way function," SICOMP, vol. 28, no. 4, pp. 1364-1396, 1999.
21. Y. Ishai and E. Kushilevitz, "Private simultaneous messages protocols with applications," in ISTCS, 1997.
22. -, "Randomizing polynomials: A new representation with applications to round-efficient secure computation," in FOCS, 2000.
23. -, "Perfect constant-round secure computation via perfect randomizing polynomials." in ICALP, 2002.
24. M. J. Jansen and B. V. R. Rao, "Simulation of arithmetical circuits by branching programs with preservation of constant width and syntactic multilinearity," in CSR, 2009.
25. J. Katz, R. Ostrovsky, and A. Smith, "Round efficiency of multi-party computation with a dishonest majority," in EUROCRYPT, 2003.
26. J. Kilian, "Founding cryptography on oblivious transfer," in STOC, 1988.
27. Y. Lindell, "Parallel coin-tossing and constant-round secure two-party computation," in CRYPTO, 2001.
28. Y. Lindell and B. Pinkas, "A proof of Yao's protocol for secure two-party computation," J. Cryptology, vol. 22, no. 2, pp. 161-188, 2009.
29. V. Lyubashevsky and D. Micciancio, "On bounded distance decoding, unique shortest vectors, and the minimum distance problem," in CRYPTO, 2009.
30. V. Lyubashevsky, C. Peikert, and D. Micciancio, "On Ideal Lattices and Learning with Errors Over Rings," in EUROCRYPT, 2010.
31. M. Mahajan and B. V. R. Rao, "Small-space analogues of valiant's classes," in FCT, 2009.
32. M. Naor, B. Pinkas, and R. Sumner, "Privacy preserving auctions and mechanism design," in EC, 1999.
33. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in EUROCRYPT, 1999.
34. C. Peikert, "Public-key cryptosystems from the worst-case shortest vector problem," in STOC, 2009.
35. O. Regev, "On lattices, learning with errors, random linear codes, and cryptography," in STOC, 2005.
36. -, "The learning with errors problem (invited survey)," in CCC, 2010.
37. A. Sahai and H. Seyalioglu, "Worry-free encryption: functional encryption with public keys," in ACM CCS, 2010.
38. T. Sander, A. Young, and M. Yung, "Non-interactive cryptocomputing for NC1." in FOCS, 1999.
39. L. Valiant, "Completeness classes in algebra," in STOC, 1979.
40. A. C. Yao, "Protocols for secure computation," in FOCS, 1982.
41. -, "How to generate and exchange secrets," in FOCS, 1986.