Efficiency tradeoffs for malicious two-party computation

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

Volumn 3958 LNCS, Issue , 2006, Pages 458-473

  Mohassel, Payman ^a   Franklin, Matthew ^a  

^a University of California   (United States)

Author keywords

Malicious adversary; Secure function evaluation; Secure two party computation; Yao's garbled circuit

Indexed keywords

INFORMATION THEORY; LOGIC DESIGN; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

MALICIOUS ADVERSARY; SECURE FUNCTION EVALUATION; SECURE TWO-PARTY COMPUTATION; YAO'S GARBLED CIRCUIT;

COMPUTATION THEORY;

EID: 33745843587     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_30     Document Type: Conference Paper

References (18)

1. [AFK87] M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. In STOC '87: Proceedings of the nineteenth annual ACM conference on Theory of computing, pages 195-203. ACM Press, 1987.
2. [AIR01] W. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. Eurocrypt, 2001.
3. [BYCKO93] R. Bar-Yehuda, B. Chor, E. Kushilevitz, and A. Orlitsky. Privacy, additional information, and communication. IEEE Transactions on Information Theory, 1993.
4. [Cle89] R. Cleve. Controlled gradual disclosure schemes for random bits and their applications. In CRYPTO '89: Proceedings on Advances in cryptology, pages 573-588. Springer-Verlag, 1989.
5. [FNW96] R. Fagin, M. Naor, and P. Winkler. Comparing information without leaking it. Commun. ACM, 39(5):77-85, 1996.
6. [GMR89] S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput., 18(1):186-208, 1989.
7. [GMW86] O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in np have zero-knowledge proofs. Proceedings of of the 27th FOCS, pages 174-187, 1986.
8. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In proceedings of 19th Annual ACM Symposium on Theory of Computing, pages 218-229, 1987.
9. [Gol04] O. Goldreich. Foundations of cryptography - volume 2, ch. 7. 2004.
10. [GP99] O. Goldreich and E. Petrank. Quantifying knowledge complexity. Computational Complexity, 8:50-98, 1999.
11. [lMR83] M. luby, S. Micali, and C. Rackoff. How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. FOCS, 1983.
12. [LP04] Y. Lindell and B. Pinkas. A proof of yao's protocol for secure two-party computation, eprint archive, 2004.
13. [MNPS04] D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay- a secure two-party computation system. Proceedings of Usenix security, 2004.
14. [Ped91] T. P. Pederson. Non-interactive and information-theoritic secure verifiable secret-sharing. 1991.
15. [Pin03] Benny Pinkas. Fair secure two-party computation. Eurocrypt, LNCS 2656, Springer-Verlag, pp. 87-105, 2003.
16. [Rab81] M. Rabin. How to exchange secrets by oblivious transfer. Technical Report Tech., Memo. TR-81, Aiken Computation Labratory, Harvard University, 1981.
17. [Woo06] D. Woodruff, unpublished manuscript, 2006.
18. [Yao86] A. C. Yao. How to generate and exchange secrets. In Proceedings of the 27th IEEE syrnposioum on Foundations of Computer science,pages 162-167, 1986.