A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

Journal of Computer Security

Volumn 21, Issue 2, 2013, Pages 283-315

  Kolesnikov, Vladimir ^a   Sadeghi, Ahmad Reza ^b   Schneider, Thomas ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Framework; garbled functions; homomorphic encryption; privacy preserving protocols; protocol design

Indexed keywords

CLIENT-SERVER INTERACTIONS; FRAMEWORK; HO-MOMORPHIC ENCRYPTIONS; MEDICAL CLASSIFICATION; METHODOLOGICAL CONTRIBUTIONS; PRIVACY-PRESERVING PROTOCOLS; PROTOCOL DESIGN; SECURE FUNCTION EVALUATION;

FACE RECOGNITION; STUDENTS;

CRYPTOGRAPHY;

EID: 84876221854     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-130464     Document Type: Article

References (122)

1. W. Aiello, Y. Ishai and O. Reingold, Priced oblivious transfer: How to sell digital goods, in: Advances in Cryptology-EUROCRYPT'01, LNCS, Vol. 2045, Springer, 2001, pp. 119-135. (Pubitemid 33275828)
2. E. Allender, M.C. Loui and K.W. Regan, Complexity classes, in: Algorithms and Theory of Computation Handbook, M.J. Atallah, ed., CRC Press, 1999, Chapter 27.
3. F. Armknecht and A.-R. Sadeghi, A new approach for algebraically homomorphic encryption, Cryptology ePrint Archive, Report 2008/422, 2008, available at: http://eprint.iacr.org/.
4. Y. Aumann and Y. Lindell, Security against covert adversaries: Efficient protocols for realistic adversaries, Journal of Cryptology 23(2) (2010), 281-343.
5. M. Barni, P. Failla, V. Kolesnikov, R. Lazzeretti, A.-R. Sadeghi and T. Schneider, Secure evaluation of private linear branching programs with medical applications, in: European Symposium on Research in Computer Security (ESORICS'09), LNCS, Vol. 5789, Springer, 2009, pp. 424-439.
6. D. Beaver, Precomputing oblivious transfer, in: Advances in Cryptology-CRYPTO'95, LNCS, Vol. 963, Springer, 1995, pp. 97-109.
7. M. Bellare, V.T. Hoang and P. Rogaway, Foundations of garbled circuits, in: ACM Computer and Communications Security (CCS'12), ACM, 2012, pp. 784-796.
8. A. Ben-David, N. Nisan and B. Pinkas, FairplayMP: a system for secure multi-party computation, in: ACM Computer and Communications Security (CCS'08), ACM, 2008, pp. 257-266.
9. M. Blanton and P. Gasti, Secure and efficient protocols for iris and fingerprint identification, in: European Symposium on Research in Computer Security (ESORICS'11), LNCS, Vol. 6879, Springer, 2011, pp. 190-209.
10. D. Bogdanov, S. Laur and J. Willemson, Sharemind: A framework for fast privacy-preserving computations, in: European Symposium on Research in Computer Security (ESORICS'08), LNCS, Vol. 5283, Springer, 2008, pp. 192-206.
11. D. Bogdanov, R. Talviste and J. Willemson, Deploying secure multi-party computation for financial data analysis (short paper), in: Financial Cryptography and Data Security (FC'12), LNCS, Vol. 7397, Springer, 2012, pp. 57-64.
12. P. Bogetoft, D.L. Christensen, I. Damgård, M. Geisler, T.P. Jakobsen, M. Krøigaard, J.D. Nielsen, J.B. Nielsen, K. Nielsen, J. Pagter, M.I. Schwartzbach and T. Toft, Secure multiparty computation goes live, in: Financial Cryptography and Data Security (FC'09), LNCS, Vol. 5628, Springer, 2009, pp. 325-343.
13. B. Bollig, M. Löbbing and I. Wegener, Simulated annealing to improve variable orderings for OBDDs, in: IEEE/ACM International Workshop on Logic Synthesis (IWLS'95), 1995.
14. B. Bollig and I.Wegener, Improving the variable ordering of OBDDs is NP-complete, IEEE Transactions on Computers 45(9) (1996), 993-1002. (Pubitemid 126768781)
15. D. Boneh, E.-J. Goh and K. Nissim, Evaluating 2-dnf formulas on ciphertexts, in: Theory of Cryptography Conference (TCC'05), LNCS, Vol. 3378, Springer, 2005, pp. 325-341. (Pubitemid 41231172)
16. J. Boyar, R. Peralta and D. Pochuev, On the multiplicative complexity of Boolean functions over the basis (∧,⊕, 1), Theoretical Computer Science 235(1) (2000), 43-57.
17. J. Brickell, D.E. Porter, V. Shmatikov and E. Witchel, Privacy-preserving remote diagnostics, in: ACM Computer and Communications Security (CCS'07), ACM, 2007, pp. 498-507.
18. J. Brickell and V. Shmatikov, Privacy-preserving graph algorithms in the semi-honest model, in: Advances in Cryptology-ASIACRYPT'05, LNCS, Vol. 3788, Springer, 2005, pp. 236-252. (Pubitemid 43763478)
19. J. Brickell and V. Shmatikov, Privacy-preserving classifier learning, in: Financial Cryptography and Data Security (FC'09), LNCS, Vol. 5628, Springer, 2009, pp. 128-147.
20. R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers 35(8) (1986), 677-691.
21. R.E. Bryant, On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication, IEEE Transactions on Computers 40(2) (1991), 205-213.
22. C. Cachin, J. Camenisch, J. Kilian and J. Müller, One-round secure computation and secure autonomous mobile agents, in: International Colloquium on Automata, Languages and Programming (ICALP'00), LNCS, Vol. 1853, Springer, 2000, pp. 512-523.
23. S.G. Choi, K.-W. Hwang, J. Katz, T. Malkin and D. Rubenstein, Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces, in: The Cryptographers' Track at the RSA Conference (CT-RSA), LNCS, Vol. 7178, Springer, 2012, pp. 416-432.
24. S.G. Choi, J. Katz, R. Kumaresan and H.-S. Zhou, On the security of the ";;Free-XOR";; technique, in: Theory of Cryptography Conference (TCC'12), LNCS, Vol. 7194, Springer, 2012, pp. 39-53.
25. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd edn, The MIT Press, Cambridge, MA, USA, 2001.
26. I. Damgård, M. Geisler and M. Krøigaard, Efficient and secure comparison for on-line auctions, in: Australian Conference on Information Security and Privacy (ACISP'07), LNCS, Vol. 4586, Springer, 2007, pp. 416-430.
27. I. Damgård, M. Geisler and M. Krøigaard, A correction to ";;Efficient and secure comparison for on-line auctions";;, Cryptology ePrint Archive, Report 2008/321, 2008, available at: http://eprint. iacr.org/.
28. I. Damgård, M. Geisler and M. Krøigaard, Homomorphic encryption and secure comparison, Journal of Applied Cryptology 1(1) (2008), 22-31.
29. I. Damgård and M. Jurik, A generalisation, a simplification and some applications of Paillier's probabilistic public-key system, in: Public Key Cryptography (PKC'01), LNCS, Vol. 1992, Springer, 2001, pp. 119-136. (Pubitemid 33232937)
30. I. Damgård and M. Keller, Secure multiparty AES, in: Financial Cryptography and Data Security (FC'10), LNCS, Vol. 6052, Springer, 2010, pp. 367-374.
31. I. Damgård and C. Orlandi, Multiparty computation for dishonest majority: from passive to active security at low cost, in: Advances in Cryptology-CRYPTO'10, LNCS, Vol. 6223, Springer, 2010, pp. 558-576.
32. I. Damgard, V. Pastro, N.P. Smart and S. Zakarias, Multiparty computation from somewhat homomorphic encryption, in: Advances in Cryptology-CRYPTO'12, LNCS, Vol. 7417, 2012, pp. 643-662.
33. R. Drechsler, B. Becker and N. Gockel, Genetic algorithm for variable ordering of OBDDs, IEE Proceedings on Computers and Digital Techniques 143(6) (1996), 364-368. (Pubitemid 126761041)
34. T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, in: Advances in Cryptology-CRYPTO'84, LNCS, Vol. 196, Springer, 1985, pp. 10-18.
35. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk and T. Toft, Privacy-preserving face recognition, in: Privacy Enhancing Technologies Symposium (PETS'09), LNCS, Vol. 5672, Springer, 2009, pp. 235-253.
36. K.B. Frikken, Practical private DNA string searching and matching through efficient oblivious automata evaluation, in: Workshop on Database Security (DBSec'09), LNCS, Vol. 5645, Springer, 2009, pp. 81-94.
37. K.B. Frikken, M.J. Atallah and J. Li, Hidden access control policies with hidden credentials, in: ACM Workshop on Privacy in the Electronic Society (WPES'04), ACM, 2004, p. 27.
38. K.B. Frikken, M.J. Atallah and J. Li, Attribute-based access control with hidden policies and hidden credentials, IEEE Transactions on Computers 55(10) (2006), 1259-1270. (Pubitemid 44355937)
39. K.B. Frikken, M.J. Atallah and C. Zhang, Privacy-preserving credit checking, in: Electronic Commerce (EC'05), ACM, 2005, pp. 147-154. (Pubitemid 43048674)
40. K.B. Frikken, J. Li and M.J. Atallah, Trust negotiation with hidden credentials, hidden policies, and policy cycles, in: Network and Distributed System Security Symposium (NDSS'06), The Internet Society, 2006.
41. M. Fujita, Y. Matsunaga and T. Kakuda, On variable ordering of binary decision diagrams for the application of multi-level logic synthesis, in: European Design Automation Conference (EURO-DAC'91), IEEE, 1991, pp. 50-54. (Pubitemid 23584321)
42. J.A. Garay, P. MacKenzie and K. Yang, Efficient and universally composable committed oblivious transfer and applications, in: Theory of Cryptography Conference (TCC'04), LNCS, Vol. 2951, Springer, 2004, pp. 297-316.
43. R. Gennaro, C. Gentry and B. Parno, Non-interactive verifiable computing: Outsourcing computation to untrusted workers, in: Advances in Cryptology-CRYPTO'10, LNCS, Vol. 6223, Springer, 2010, pp. 465-482.
44. C. Gentry, Fully homomorphic encryption using ideal lattices, in: ACM Symposium on Theory of Computing (STOC'09), ACM, 2009, pp. 169-178.
45. C. Gentry and S. Halevi, Implementing gentry's fully-homomorphic encryption scheme, in: Advances in Cryptology-EUROCRYPT'11, LNCS, Vol. 6632, Springer, 2011, pp. 129-148.
46. C. Gentry, S. Halevi and V. Vaikuntanathan, A simple BGN-type cryptosystem from LWE, in: Advances in Cryptology-EUROCRYPT'10, LNCS, Vol. 6110, Springer, 2010, pp. 506-522.
47. D. Giry and J.-J. Quisquater, Cryptographic key length recommendation, March 2009, available at: http://keylength.com.
48. O. Goldreich, Foundations of Cryptography, Basic Applications, Vol. 2, Cambridge Univ. Press, 2004, Draft available at: http://www.wisdom.weizmann.ac. il/∼oded/foc-vol2.html.
49. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, in: ACM Symposium on Theory of Computing (STOC'87), ACM, 1987, pp. 218-229.
50. S. Goldwasser, Y.T. Kalai and G.N. Rothblum, One-time programs, in: Advances in Cryptology-CRYPTO'08, LNCS, Vol. 5157, Springer, 2008, pp. 39-56.
51. V. Goyal, P. Mohassel and A. Smith, Efficient two party and multi party computation against covert adversaries, in: Advances in Cryptology-EUROCRYPT'08, LNCS, Vol. 4965, Springer, 2008, pp. 289-306. (Pubitemid 351762836)
52. V. Gunupudi and S. Tate, Generalized non-interactive oblivious transfer using count-limited objects with applications to secure mobile agents, in: Financial Cryptography and Data Security (FC'08), LNCS, Vol. 5143, Springer, 2008, pp. 98-112.
53. D. Harnik, Y. Ishai, E. Kushilevitz and J.B. Nielsen, OT-combiners via secure computation, in: Theory of Cryptography Conference (TCC'08), LNCS, Vol. 4948, Springer, 2008, pp. 393-411.
54. C. Hazay and Y. Lindell, Efficient Secure Two-Party Protocols: Techniques and Constructions, Springer, New York, NY, USA, 2010.
55. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider and I. Wehrenberg, TASTY: Tool for Automating Secure Two-partY computations, in: ACM Computer and Communications Security (CCS'10), ACM, 2010, pp. 451-462, Full version available at: http://eprint.iacr.org/2010/365.
56. Y. Huang, D. Evans, J. Katz and L. Malka, Faster secure two-party computation using garbled circuits, in: USENIX Security Symposium (Security'11), USENIX, 2011, pp. 539-554.
57. Y. Huang, J. Katz and D. Evans, Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution, in: IEEE Symposium on Security and Privacy (S&P'08), IEEE, 2008, pp. 216-230.
58. Y. Huang, L. Malka, D. Evans and J. Katz, Efficient privacy-preserving biometric identification, In: Network and Distributed System Security Symposium (NDSS'11), The Internet Society, 2011.
59. A. Iliev and S.W. Smith, Small, stupid, and scalable: Secure computing with Faerieplay, in: ACM Workshop on Scalable Trusted Computing (STC'10), ACM, 2010, pp. 41-51.
60. Y. Ishai, J. Kilian, K. Nissim and E. Petrank, Extending oblivious transfers efficiently, in: Advances in Cryptology-CRYPTO'03, LNCS, Vol. 2729, Springer, 2003, pp. 145-161. (Pubitemid 137636940)
61. Y. Ishai and A. Paskin, Evaluating branching programs on encrypted data, in: Theory of Cryptography Conference (TCC'07), LNCS, Vol. 4392, Springer, 2007, pp. 575-594.
62. Y. Ishai, M. Prabhakaran and A. Sahai, Founding cryptography on oblivious transfer-efficiently, in: Advances in Cryptology-CRYPTO'08, LNCS, Vol. 5157, Springer, 2008, pp. 572-591.
63. T.P. Jakobsen, M.X. Makkes and J.D. Nielsen, Efficient implementation of the Orlandi protocol, in: Applied Cryptography and Network Security (ACNS'10), LNCS, Vol. 6123, Springer, 2010, pp. 255-272.
64. S. Jarecki and V. Shmatikov, Efficient two-party secure computation on committed inputs, in: Advances in Cryptology-EUROCRYPT'07, LNCS, Vol. 4515, Springer, 2007, pp. 97-114.
65. A. Jarrous and B. Pinkas, Secure hamming distance based computation and its applications, in: Applied Cryptography and Network Security (ACNS'09), LNCS, Vol. 5536, Springer, 2009, pp. 107-124.
66. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi and T. Schneider, Efficient secure two-party computation with untrusted hardware tokens, in: Towards Hardware Intrinsic Security: Foundation and Practice, Information Security and Cryptography, Springer, 2010, pp. 367-386.
67. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi and T. Schneider, Embedded SFE: Offloading server and network using hardware tokens, in: Financial Cryptography and Data Security (FC'10), LNCS, Vol. 6052, Springer, 2010, pp. 207-221.
68. K. Järvinen, V. Kolesnikov, A.-R. Sadeghi and T. Schneider, Garbled circuits for leakage-resilience: Hardware implementation and evaluation of one-time programs, in: Cryptographic Hardware and Embedded Systems (CHES'10), LNCS, Vol. 6225, Springer, 2010, pp. 383-397.
69. S. Jha, L. Kruger and V. Shmatikov, Towards practical privacy for genomic computation, in: IEEE Symposium on Security and Privacy (S&P'08), IEEE, 2008, pp. 216-230.
70. V. Kabanets and J. Cai, Circuit minimization problem, in: ACM Symposium on Theory of Computing (STOC'00), ACM, 2000, pp. 73-79.
71. A. Karatsuba and Y. Ofman, Multiplication of many-digital numbers by automatic computers, Proceedings of the SSSR Academy of Sciences, 145 (1962), 293-294.
72. J. Katz and L. Malka, Secure text processing with applications to private DNA matching, in: ACM Computer and Communications Security (CCS'10), ACM, 2010, pp. 485-492.
73. J. Katz and L. Malka, Constant-round private function evaluation with linear complexity, in: Advances in Cryptology-ASIACRYPT'11, LNCS, Vol. 7073, Springer, 2011, pp. 556-571.
74. M.S. Kiraz and B. Schoenmakers, A protocol issue for the malicious case of Yao's garbled circuit construction, in: 27th Symposium on Information Theory in the Benelux, 2006, pp. 283-290.
75. V. Kolesnikov, A.-R. Sadeghi and T. Schneider, Improved garbled circuit building blocks and applications to auctions and computing minima, in: Cryptology and Network Security (CANS'09), LNCS, Vol. 5888, Springer, 2009, pp. 1-20.
76. V. Kolesnikov and T. Schneider, Improved garbled circuit: Free XOR gates and applications, in: International Colloquium on Automata, Languages and Programming (ICALP'00), LNCS, Vol. 5126, Springer, 2008, pp. 486-498.
77. V. Kolesnikov and T. Schneider, A practical universal circuit construction and secure evaluation of private functions, in: Financial Cryptography and Data Security (FC'08), LNCS, Vol. 5143, Springer, 2008, pp. 83-97.
78. B. Kreuter, A. Shelat and C.-H. Shen, Towards billion-gate secure computation with malicious adversaries, in: USENIX Security Symposium (Security'12), USENIX, 2012.
79. L. Kruger, S. Jha, E.-J. Goh and D. Boneh, Secure function evaluation with ordered binary decision diagrams, in: ACM Computer and Communications Security (CCS'06), ACM, 2006, pp. 410-420. (Pubitemid 47131388)
80. K. Lauter,M. Naehrig and V. Vaikuntanathan, Can homomorphic encryption be practical?, in: ACM Cloud Computing Security Workshop (CCSW'11), ACM, 2011, pp. 113-124.
81. W. Lenders and C. Baier, Genetic algorithms for the variable ordering problem of binary decision diagrams, in: Foundations of Genetic Algorithms (FOGA'05), LNCS, Vol. 3469, 2005, pp. 1-20. (Pubitemid 41313304)
82. Y. Lindell, E. Oxman and B. Pinkas, The IPS compiler: Optimizations, variants and concrete efficiency, in: Advances in Cryptology-CRYPTO'11, LNCS, Vol. 6841, Springer, 2011, pp. 259-276.
83. Y. Lindell and B. Pinkas, Privacy preserving data mining, Journal of Cryptology 15(3) (2002), 177-206. (Pubitemid 44126466)
84. Y. Lindell and B. Pinkas, An efficient protocol for secure two-party computation in the presence of malicious adversaries, in: Advances in Cryptology-EUROCRYPT'07, LNCS, Vol. 4515, Springer, 2007, pp. 52-78.
85. Y. Lindell and B. Pinkas, A proof of Yao's protocol for secure two-party computation, Journal of Cryptology 22(2) (2009), 161-188.
86. Y. Lindell and B. Pinkas, Secure multiparty computation for privacy-preserving data mining, Journal of Privacy and Confidentiality 1(1) (2009), 59-98.
87. Y. Lindell and B. Pinkas, Secure two-party computation via cut-and-choose oblivious transfer, in: Theory of Cryptography Conference (TCC'11), LNCS, Vol. 6597, Springer, 2011, pp. 329-346.
88. Y. Lindell, B. Pinkas and N.P. Smart, Implementing two-party computation efficiently with security against malicious adversaries, in: Security in Communication Networks (SCN'08), LNCS, Vol. 5229, Springer, 2008, pp. 2-20.
89. H. Lipmaa, Verifiable homomorphic oblivious transfer and private equality test, in: Advances in Cryptology-ASIACRYPT'03, LNCS, Vol. 2894, Springer, 2003, pp. 416-433.
90. H. Lipmaa, Private branching programs: On communication-efficient cryptocomputing, Cryptology ePrint Archive, Report 2008/107, 2008, available at: http://eprint.iacr.org/.
91. P.D. MacKenzie, A. Oprea and M.K. Reiter, Automatic generation of two-party computations, in: ACM Computer and Communications Security (CCS'03), ACM, 2003, pp. 210-219. (Pubitemid 40673803)
92. L. Malka, VMCrypt-modular software architecture for scalable secure computation, in: ACM Computer and Communications Security (CCS'11), ACM, 2011, pp. 715-724.
93. D. Malkhi, N. Nisan, B. Pinkas and Y. Sella, Fairplay-a secure two-party computation system, in: USENIX Security Symposium (Security'08), 2004, available at: http://fairplayproject.net.
94. P. Mohassel and M.K. Franklin, Efficiency tradeoffs for malicious two-party computation, in: Public Key Cryptography (PKC'06), LNCS, Vol. 3958, Springer, 2006, pp. 458-473. (Pubitemid 44029599)
95. B. Mood, L. Letaw and K. Butler, Memory-efficient garbled circuit generation for mobile devices, in: Financial Cryptography and Data Security (FC'12), LNCS, Springer, 2012.
96. M. Naor and B. Pinkas. Efficient oblivious transfer protocols, in: ACM-SIAM Symposium On Discrete Algorithms (SODA'01), ACM Society for Industrial and Applied Mathematics, 2001, pp. 448-457.
97. M. Naor, B. Pinkas and R. Sumner, Privacy preserving auctions and mechanism design, in: Electronic Commerce (EC'99), ACM, 1999, pp. 129-139.
98. J.B. Nielsen, Extending oblivious transfers efficiently-how to get robustness almost for free, Cryptology ePrint Archive, Report 2007/215, 2007, available at: http://eprint.iacr.org/.
99. J.B. Nielsen, P.S. Nordholt, C. Orlandi and S.S. Burra, A new approach to practical active-secure two-party computation, in: Advances in Cryptology-CRYPTO'12, LNCS, Vol. 7417, Springer, 2012, pp. 681-700.
100. J.B. Nielsen and C. Orlandi, LEGO for two-party secure computation, in: Theory of Cryptography Conference (TCC'09), LNCS, Vol. 5444, Springer, 2009, pp. 368-386.
101. P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in: Advances in Cryptology-EUROCRYPT'99, LNCS, Vol. 1592, Springer, 1999, pp. 223-238.
102. A. Paus, A.-R. Sadeghi and T. Schneider, Practical secure evaluation of semi-private functions, in: Applied Cryptography and Network Security (ACNS'09), LNCS, Vol. 5536, Springer, 2009, pp. 89-106, available at: http://www.trust. rub.de/FairplaySPF.
103. B. Pinkas, T. Schneider, N.P. Smart and S.C. Williams, Secure two-party computation is practical, in: Advances in Cryptology-ASIACRYPT'09, LNCS, Vol. 5912, Springer, 2009, pp. 250-267.
104. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, in: IEEE/ACM International Conference on Computer-Aided Design (ICCAD'93), IEEE, 1993, pp. 42-47.
105. A.-R. Sadeghi and T. Schneider, Generalized universal circuits for secure evaluation of private functions with application to data classification, in: International Conference on Information Security and Cryptology (ICISC'08), LNCS, Vol. 5461, Springer, 2008, pp. 336-353.
106. A.-R. Sadeghi, T. Schneider and I. Wehrenberg, Efficient privacy-preserving face recognition, in: International Conference on Information Security and Cryptology (ICISC'09), LNCS, Springer, 2009.
107. A. Sahai and H. Seyalioglu, Worry-free encryption: functional encryption with public keys, in: ACM Computer and Communications Security (CCS'10), ACM, 2010, pp. 463-472.
108. T. Sander and C. Tschudin, Protecting mobile agents against malicious hosts, in: Mobile Agents and Security, LNCS, Vol. 1419, Springer, 1998, pp. 44-60.
109. T. Sander, A. Young and M. Yung, Non-interactive cryptocomputing for NC1, in: Foundations of Computer Science (FOCS'99), IEEE, 1999, pp. 554-566.
110. T. Schneider, Practical secure function evaluation, Master's thesis, University of Erlangen-Nuremberg, February 27, 2008, available at: http://thomaschneider.de/papers/S08Thesis.pdf.
111. A. Schröpfer, F. Kerschbaum and G. Müller, L1-a programming language for mixed-protocol secure computation, in: IEEE International Computer Software and Applications Conference (COMPSAC'11), IEEE, 2011, pp. 298-307.
112. A. Shelat and C.-H. Shen. Two-output secure computation with malicious adversaries, in: Advances in Cryptology-EUROCRYPT'11, LNCS, Vol. 6632, Springer, 2011, pp. 386-405.
113. N.P. Smart and F. Vercauteren, Fully homomorphic encryption with relatively small key and ciphertext sizes, in: Public Key Cryptography (PKC'10), LNCS, Vol. 6056, Springer, 2010, pp. 420-443.
114. J.R. Troncoso-Pastoriza, S. Katzenbeisser and M.U. Celik, Privacy preserving error resilient DNA searching through oblivious automata, in: ACM Computer and Communications Security (CCS'07), ACM, 2007, pp. 519-528.
115. L.G. Valiant, Universal circuits (preliminary report), in: ACM Symposium on Theory of Computing (STOC'76), ACM, 1976, pp. 196-203.
116. M. van Dijk, C. Gentry, S. Halevi and V. Vaikuntanathan, Fully homomorphic encryption over the integers, in: Advances in Cryptology- EUROCRYPT'10, LNCS, Vol. 6110, Springer, 2010, pp. 24-43.
117. M. van Dijk and A. Juels, On the impossibility of cryptography alone for privacy-preserving cloud computing, in: USENIX Workshop on Hot Topics in Security (HotSec'10), USENIX, 2010.
118. H. Vollmer, Introduction to Circuit Complexity: A Uniform Approach, Springer, Secaucus, NJ, USA, 1999.
119. A. Waksman, A permutation network, Journal of the ACM 15(1) (1968), 159-163.
120. P. Woelfel, Bounds on the OBDD-size of integer multiplication via universal hashing, Journal of Computer and System Sciences 71(4) (2005), 520-534. (Pubitemid 41526428)
121. A.C. Yao, Protocols for secure computations, in: Foundations of Computer Science (FOCS'82), IEEE, 1982, pp. 160-164.
122. A.C. Yao, How to generate and exchange secrets, in: Foundations of Computer Science (FOCS'86), IEEE, 1986, pp. 162-167.