Secure computation on the web: Computing without simultaneous interaction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6841 LNCS, Issue , 2011, Pages 132-150

  Halevi, Shai ^a   Lindell, Yehuda ^b   Pinkas, Benny ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLIENT-SERVER MODELS; COMMUNICATION PATTERN; INHERENT LIMITATIONS; MALICIOUS ADVERSARIES; MODEL OF COMPUTATION; SECURE COMPUTATION; STANDARD ASSUMPTIONS; STRONG SECURITIES;

CRYPTOGRAPHY;

EID: 80051976682     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22792-9_8     Document Type: Conference Paper

References (10)

1. A Face Is Exposed for AOL Searcher No. 4417749 (The New York Times) (August 9, 2006), http://www.nytimes.com/2006/08/09/technology/09aol.html
2. Goldreich, O.: Foundations of Cryptography, Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
3. Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: Foundations of Secure Computation, pp. 169-177. Academic Press, London (1978)
4. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st ACM Symposium on Theory of Computing - STOC 2009, pp. 169-178. ACM, New York (2009)
5. Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
6. Gentry, C., Halevi, S., Vaikuntanathan, V.: i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 155-172. Springer, Heidelberg (2010), Full version available online at http://eprint.iacr.org/2010/145
7. Harnik, D., Ishai, Y., Kushilevitz, E.: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 284-302. Springer, Heidelberg (2007)
8. Choi, S.G., Elbaz, A., Malkin, T., Yung, M.: Secure Multi-party Computation Minimizing Online Rounds. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 268-286. Springer, Heidelberg (2009)
9. Halevi, S., Lindell, Y., Pinkas, B.: Secure Computation on the Web: Computing without Simultaneous Interaction, http://eprint.iacr.org/2011/157
10. De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Non-interactive Zero Knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566-598. Springer, Heidelberg (2001)