VMCrypt - Modular software architecture for scalable secure computation

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 715-724

  Malka, Lior ^a  

^a INTEL CORPORATION   (United States)

Author keywords

Scalable; Secure computation; Software API

Indexed keywords

GARBLED CIRCUITS; NOVEL ALGORITHM; PROGRAMMING INTERFACE; SCALABLE; SECURE COMPUTATION; SMALL MEMORY REQUIREMENTS; SOFTWARE API; SOURCE CODES;

ALGORITHMS; APPLICATION PROGRAMMING INTERFACES (API); COMPUTATION THEORY; SECURITY OF DATA; SOFTWARE ARCHITECTURE;

CRYPTOGRAPHY;

EID: 80755168310     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046787     Document Type: Conference Paper

References (31)

1. M. Barni, T. Bianchi, D. Catalano, M. D. Raimondo, R. D. Labati, and P. Faillia. Privacy-preserving fingercode authentication. In MM&Sec', Roma, Italy, 2010. ACM.
2. A. Ben-David, N. Nisan, and B. Pinkas. Fairplaymp: a system for secure multi-party computation. In ACM Conference on Computer and Communications Security, pages 257-266, 2008.
3. D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS, pages 192-206, 2008.
4. I. Damgård, M. Geisler, M. Krøigaard, and J. B. Nielsen. Asynchronous multiparty computation: Theory and implementation. In Public Key Cryptography, pages 160-179, 2009.
5. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of paillier's probabilistic public-key system. In Public Key Cryptography, pages 119-136, 2001. (Pubitemid 33232937)
6. I. Damgård and C. Orlandi. Multiparty computation for dishonest majority: From passive to active security at low cost. In CRYPTO, pages 558-576, 2010.
7. Z. Erkin, M. Franz, J. Guajardo, S. Katzenbeisser, I. Lagendijk, and T. Toft. Privacy-preserving face recognition. In Privacy Enhancing Technologies, pages 235-253, 2009.
8. D. Evans, Y. Huang, J. Katz, and L. Malka. Efficient privacy-preserving biometric identification. In Proceedings of the 17th conference Network and Distributed System Security Symposium, NDSS 2011.
9. D. Evans, Y. Huang, J. Katz, and L. Malka. Faster secure two-party computation using garbled circuits. To appear in the 20th USENIX Security Symposium.
10. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
11. W. Henecka, S. Kögl, A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Tasty: Tool for automating secure two-party computations. In ACM Conference on Computer and Communications Security, 2010.
12. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO, pages 145-161, 2003. (Pubitemid 137636940)
13. S. Jha, L. Kruger, and V. Shmatikov. Towards practical privacy for genomic computation. In IEEE Symposium on Security and Privacy, pages 216-230, 2008.
14. V. Kolesnikov, A.-R. Sadeghi, and T. Schneider. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS, pages 1-20, 2009.
15. V. Kolesnikov and T. Schneider. Improved garbled circuit: Free XOR gates and applications. In ICALP '08: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, pages 486-498, Berlin, Heidelberg, 2008. Springer-Verlag.
16. Y. Lindell and B. Pinkas. A proof of security of yao's protocol for two-party computation. J. Cryptology, 22(2):161-188, 2009.
17. Y. Lindell, B. Pinkas, and N. P. Smart. Implementing two-party computation efficiently with security against malicious adversaries. In SCN, pages 2-20, 2008.
18. P. D. MacKenzie, A. Oprea, and M. K. Reiter. Automatic generation of two-party computations. In ACM Conference on Computer and Communications Security, pages 210-219, 2003. (Pubitemid 40673803)
19. L. Malka. VMCrypt 1.4 developers manual. http://www.lior.ca/publications/ VMCrypt-Manual-Rev1.0.pdf.
20. L. Malka. VMCrypt - modular software architecture for scalable secure computation. EPrint report 2010/584, 2010.
21. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In SSYM04: Proceedings of the 13th conference on USENIX Security Symposium, pages 20-20, Berkeley, CA, USA, 2004. USENIX Association.
22. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SODA, pages 448-457, 2001.
23. J. D. Nielsen and M. I. Schwartzbach. A domain-specific programming language for secure multiparty computation. In PLAS, pages 21-30, 2007. (Pubitemid 350164743)
24. M. Osadchy, B. Pinkas, A. Jarrous, and B. Moskovich. Scifi - a system for secure face identification. In IEEE Symposium on Security and Privacy, pages 239-254, 2010.
25. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT'99: Proceedings of the 17th international conference on Theory and application of cryptographic techniques, pages 223-238, Berlin, Heidelberg, 1999. Springer-Verlag.
26. A. Paus, A.-R. Sadeghi, and T. Schneider. Practical secure evaluation of semi-private functions. In ACNS, pages 89-106, 2009.
27. B. Pinkas, T. Schneider, N. P. Smart, and S. C. Williams. Secure two-party computation is practical. In ASIACRYPT, pages 250-267, 2009.
28. A.-R. Sadeghi, T. Schneider, and I. Wehrenberg. Efficient privacy-preserving face recognition. In ICISC, pages 229-244, 2009.
29. N. P. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography, pages 420-443, 2010.
30. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully homomorphic encryption over the integers. In EUROCRYPT, pages 24-43, 2010.
31. A. C.-C. Yao. How to generate and exchange secrets (extended abstract). In FOCS, pages 162-167, 1986.