A domain-specific language for computing on encrypted data

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 13, Issue , 2011, Pages 6-24

  Bain, Alex ^a   Mitchell, John ^a   Sharma, Rahul ^a   Stefan, Deian ^a   Zimmerman, Joe ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Domain Specific Language; Homomorphic Encryption; Secret Sharing

Indexed keywords

COMPUTATIONAL FEASIBILITY; CRYPTOGRAPHIC CLOUDS; DOMAIN SPECIFIC LANGUAGES; EXECUTION PLATFORMS; HO-MOMORPHIC ENCRYPTIONS; INFORMATION-THEORETIC SECURITY; SECRET SHARING; SECURE MULTI-PARTY COMPUTATION;

CLOUD COMPUTING; PROBLEM ORIENTED LANGUAGES; SOFTWARE ENGINEERING;

CRYPTOGRAPHY;

EID: 84880205249     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2011.6     Document Type: Conference Paper

References (30)

1. B. Applebaum, Y. Ishai, and E. Kushilevitz. From secrecy to soundness: Efficient verification via secure computation. In ICALP (1), pages 152-163, 2010.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In STOC, pages 1-10, 1988.
3. D. Bogdanov, S. Laur, and J. Willemson. Sharemind: A framework for fast privacy-preserving computations. In ESORICS, pages 192-206, 2008.
4. P. Bogetoft, D. L. Christensen, I. Damgard, M. Geisler, T. Jakobsen, M. Krøigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft. Multiparty computation goes live. Cryptology ePrint Archive, Report 2008/068, 2008. http://eprint.iacr.org/.
5. P. Bogetoft, I. B. Damgård, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft. Secure computing, economy, and trust: A generic solution for secure auctions with real-world applications. Technical Report RS-05-18, BRICS, 2005.
6. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-dnf formulas on ciphertexts. In TCC, pages 325-341, 2005.
7. R. Cramer, I. Damgård, and U. M. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT, pages 316-334, 2000.
8. 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.
9. I. Damgård, Y. Ishai, and M. Krøigaard. Perfectly secure multiparty computation and the computational overhead of cryptography. In EUROCRYPT, pages 445-465, 2010.
10. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified vss and fact-track multiparty computations with applications to threshold cryptography. In PODC, pages 101-111, 1998.
11. C. Gentry. Fully homomorphic encryption using ideal lattices. In STOC, pages 169-178, 2009.
12. C. Gentry. Computing arbitrary functions of encrypted data. Commun. ACM, 53(3): 97-105, 2010.
13. C. Gentry and S. Halevi. Gentry-Halevi implementation of a fully-homomorphic encryption scheme. https://researcher.ibm.com/researcher/ files/us-shaih/fhe-code.zip.
14. C. Gentry and S. Halevi. Implementing gentry's fully-homomorphic encryption scheme. In EUROCRYPT, pages 129-148, 2011.
15. C. Gentry, S. Halevi, and V. Vaikuntanathan. A simple bgn-type cryptosystem from lwe. In EUROCRYPT, pages 506-522, 2010.
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In STOC, pages 218-229, 1987.
17. Embedded domain-specific languages in haskell. http://www.haskell.org/ haskellwiki/Research-papers/Domain-specific-languages.
18. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In FOCS, pages 294-304, 2000.
19. Y. Ishai, E. Kushilevitz, and A. Paskin. Secure multiparty computation with minimal interaction. In CRYPTO, pages 577-594, 2010.
20. Y. Ishai and A. Paskin. Evaluating branching programs on encrypted data. In TCC, pages 575-594, 2007.
21. Y. Lindell and B. Pinkas. A proof of security of yao's protocol for two-party computation. J. Cryptology, 22(2): 161-188, 2009.
22. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - secure two-party computation system. In USENIX Security Symposium, pages 287-302, 2004.
23. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In STOC, pages 590-599, 2001.
24. J. D. Nielsen and M. I. Schwartzbach. A domain-specific programming language for secure multiparty computation. In PLAS, pages 21-30, 2007.
25. T. Nishide and K. Ohta. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In Public Key Cryptography, pages 343-360, 2007.
26. A. Sabelfeld and A. C. Myers. Language-based information-flow security. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 21(1): 2003, 2003.
27. M. C. Silaghi. Smc: Secure multiparty computation language. http://www.cs.fit.edu/~msilaghi/SMC/tutorial.html, 2004.
28. N. P. Smart and F. Vercauteren. Fully homomorphic encryption with relatively small key and ciphertext sizes. In Public Key Cryptography, pages 420-443, 2010.
29. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully homomorphic encryption over the integers. In EUROCRYPT, pages 24-43, 2010.
30. A. Yao. Protocols for secure computations (extended abstract). In FOCS, pages 160-164, 1982.