How to hide circuits in MPC an efficient framework for private function evaluation

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

Volumn 7881 LNCS, Issue , 2013, Pages 557-574

  Mohassel, Payman ^a   Sadeghian, Saeed ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SEMI-HONEST ADVERSARIES; SINGLE GATES; TWO-COMPONENT;

CRYPTOGRAPHY; ELECTRIC NETWORK TOPOLOGY; MAPPING; MODEL PREDICTIVE CONTROL;

FUNCTION EVALUATION;

EID: 84883405975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38348-9_33     Document Type: Conference Paper

References (23)

1. Abadi, M., Feigenbaum, J.: Secure circuit evaluation. Journal of Cryptology 2, 1-12 (1990)
2. Kolesnikov, V., Schneider, T.: A practical universal circuit construction and secure evaluation of private functions. In: Tsudik, G. (ed.) FC 2008. LNCS, vol. 5143, pp. 83-97. Springer, Heidelberg (2008)
3. Sadeghi, A.R., Schneider, T.: Generalized universal circuits for secure evaluation of private functions with application to data classification. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 336-353. Springer, Heidelberg (2009)
4. Katz, J., Malka, L.: Constant-round private function evaluation with linear complexity. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 556-571. Springer, Heidelberg (2011)
5. Schneider, T.: Practical secure function evaluation (2008)
6. Valiant, L.: Universal circuits (preliminary report). In: Proceedings of the Eighth Annual ACM STOC, pp. 196-203 (1976)
7. Shpilka, A., Yehudayoff, A.: Arithmetic circuits: A survey of recent results and open questions (2010)
8. Raz, R.: Elusive functions and lower bounds for arithmetic circuits. In: Proceedings of the 40th Annual ACM STOC (2008)
9. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM, STOC 2009, pp. 169-178. ACM (2009)
10. Huang, Y., Evans, D., Katz, J.: Private set intersection: Are garbled circuits better than custom protocols? In: Proceedings of 19th NDSS Conference (2012)
11. Wang, G., Luo, T., Goodrich, M.T., Du, W., Zhu, Z.: Bureaucratic protocols for secure two-party sorting, selection, and permuting. In: Proceedings of the 5th ACM ASIACCS, pp. 226-237 (2010)
12. Du, W.: A Study of Several Specific Secure Two-party Computation Problems. PhD thesis, Department of Computer Sciences, Purdue University (2001)
13. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM, STOC 1987, pp. 218-229. ACM (1987)
14. Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162-167 (October 1986)
15. Cramer, R., Damgård, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280-299. Springer, Heidelberg (2001)
16. Franklin, M., Gondree, M., Mohassel, P.: Multi-party indirect indexing and applications. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 283-297. Springer, Heidelberg (2007)
17. Choi, S.G., Hwang, K.-W., Katz, J., Malkin, T., Rubenstein, D.: Secure multiparty computation of boolean circuits with applications to privacy in on-line marketplaces. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol. 7178, pp. 416-432. Springer, Heidelberg (2012)
18. Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681-700. Springer, Heidelberg (2012)
19. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
20. Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
21. Mohassel, P., Sadeghian, S.: How to hide circuits in mpc: An efficient framework for private function evaluation (2013), http://eprint.iacr.org/
22. Waksman, A.: A permutation network. J. ACM 15, 159-163 (1968)
23. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)