Information-flow control for programming on encrypted data

Proceedings of the Computer Security Foundations Workshop

Volumn , Issue , 2012, Pages 45-60

  Mitchell, John C ^a   Sharma, Rahul ^a   Stefan, Deian ^a   Zimmerman, Joe ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Domain specific languages; Homomorphic encryption; Information flow control; Multiparty computation; Secure cloud computing

Indexed keywords

BOOLEAN CIRCUIT; CONTROL-FLOW; DECRYPTION KEYS; DOMAIN SPECIFIC LANGUAGES; ENCRYPTED DATA; FUNCTIONAL FEATURES; HOMOMORPHIC-ENCRYPTIONS; INFORMATION FLOW CONTROL; INFORMATION FLOWS; MULTIPARTY COMPUTATION; PRIMITIVE TYPES; RECURSIONS; SECRET SHARING; SECURE CODES; SECURE EXECUTION; SECURE MULTI-PARTY COMPUTATION; SECURITY REQUIREMENTS; SPECIALIZED KNOWLEDGE; TYPE SYSTEMS;

CLOUD COMPUTING; CRYPTOGRAPHY; FLOW CONTROL; JAVA PROGRAMMING LANGUAGE; PROBLEM ORIENTED LANGUAGES; SECURITY SYSTEMS;

SECURITY OF DATA;

EID: 84866925734     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2012.30     Document Type: Conference Paper

References (50)

1. C. Gentry, "Fully homomorphic encryption using ideal lattices," in STOC, 2009, pp. 169-178.
2. C. Gentry, "Computing arbitrary functions of encrypted data," Commun. ACM, vol. 53, no. 3, pp. 97-105, 2010.
3. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully homomorphic encryption over the integers," in EU-ROCRYPT, 2010, pp. 24-43.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)," in STOC, 1988, pp. 1-10.
5. R. Gennaro, M. O. Rabin, and T. Rabin, "Simplified VSS and fact-track multiparty computations with applications to threshold cryptography," in PODC, 1998, pp. 101-111.
6. R. Cramer, I. Damgård, and U. M. Maurer, "General secure multi-party computation from any linear secret-sharing scheme," in EUROCRYPT, 2000, pp. 316-334.
7. M. Naor and K. Nissim, "Communication preserving protocols for secure function evaluation," in STOC, 2001, pp. 590-599.
8. M. C. Silaghi, "SMC: Secure multiparty computation language," http://www.cs.fit.edu/~msilaghi/SMC/tutorial.html, 2004.
9. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, "Fairplay-secure two-party computation system," in USENIX Security Symposium, 2004, pp. 287-302.
10. 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/.
11. J. D. Nielsen and M. I. Schwartzbach, "A domain-specific programming language for secure multiparty computation," in PLAS, 2007, pp. 21-30.
12. I. Damgård, M. Geisler, M. Krøigaard, and J. B. Nielsen, "Asynchronous multiparty computation: Theory and implementation," in Public Key Cryptography, 2009, pp. 160-179.
13. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakr-ishnan, "CryptDB: protecting confidentiality with encrypted query processing," in SOSP, 2011, pp. 85-100.
14. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game or a completeness theorem for protocols with honest majority," in STOC, 1987, pp. 218-229.
15. A. Bain, J. C. Mitchell, R. Sharma, D. Stefan, and J. Zimmerman, "A domain-specific language for computing on encrypted data (invited talk)," in FSTTCS, 2011, pp. 6-24.
16. S. Garriss, M. Kaminsky, M. J. Freedman, B. Karp, D. Mazières, and H. Yu, "Re: Reliable email," in NSDI, 2006.
17. T. Sheard and S. L. P. Jones, "Template meta-programming for Haskell," SIGPLAN Notices, vol. 37, no. 12, pp. 60-75, 2002.
18. D. Boneh, E.-J. Goh, and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts," in TCC, 2005, pp. 325-341.
19. C. Gentry, S. Halevi, and V. Vaikuntanathan, "A simple BGN-type cryptosystem from LWE," in EUROCRYPT, 2010, pp. 506-522.
20. Y. Ishai and A. Paskin, "Evaluating branching programs on encrypted data," in TCC, 2007, pp. 575-594.
21. N. P. Smart and F. Vercauteren, "Fully homomorphic encryption with relatively small key and ciphertext sizes," in Public Key Cryptography, 2010, pp. 420-443.
22. A. C.-C. Yao, "Protocols for secure computations (extended abstract)," in FOCS, 1982, pp. 160-164.
23. Y. Lindell and B. Pinkas, "A proof of security of Yao's protocol for two-party computation," J. Cryptology, vol. 22, no. 2, pp. 161-188, 2009.
24. Y. Ishai and E. Kushilevitz, "Randomizing polynomials: A new representation with applications to round-efficient secure computation," in FOCS, 2000, pp. 294-304.
25. Y. Ishai, E. Kushilevitz, and A. Paskin, "Secure multiparty computation with minimal interaction," in CRYPTO, 2010, pp. 577-594.
26. I. Damgård, Y. Ishai, and M. Krøigaard, "Perfectly secure multiparty computation and the computational overhead of cryptography," in EUROCRYPT, 2010, pp. 445-465.
27. B. Applebaum, Y. Ishai, and E. Kushilevitz, "From secrecy to soundness: Efficient verification via secure computation," in ICALP (1), 2010, pp. 152-163.
28. A. Sabelfeld and A. C. Myers, "Language-based information-flow security," IEEE Journal on Selected Areas in Communications, vol. 21, no. 1, pp. 5-19, 2003.
29. D. S. J.C. Mitchell, R. Sharma and J. Zimmerman, "Information-flow control for programming on encrypted data," Cryptology ePrint Archive, Report 2012/205, 2012, http://eprint.iacr.org/.
30. F. Pottier and V. Simonet, "Information flow inference for ML," in POPL, 2002, pp. 319-330.
31. A. C. Myers, "JFlow: Practical mostly-static information flow control," in POPL, 1999, pp. 228-241.
32. O. Goldreich and R. Ostrovsky, "Software protection and simulation on oblivious RAMs," J. ACM, vol. 43, no. 3, 1996.
33. J. M. Lucassen and D. K. Gifford, "Polymorphic effect systems," in POPL, 1988, pp. 47-57.
34. D. Marino and T. D. Millstein, "A generic type-and-effect system," in TLDI, 2009, pp. 39-50.
35. C. V. Hall, K. Hammond, S. L. P. Jones, and P. Wadler, "Type classes in Haskell," in ESOP, 1994, pp. 241-256.
36. S. Liang, P. Hudak, and M. P. Jones, "Monad transformers and modular interpreters," in POPL, 1995, pp. 333-343.
37. C. Gentry and S. Halevi, "Implementing Gentry's fully-homomorphic encryption scheme," Manuscript; see https: //researcher.ibm.com/researcher/ view page.php?id=1579, 2010.
38. 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.
39. L. Damas and R. Milner, "Principal type-schemes for functional programs," in POPL, 1982, pp. 207-212.
40. D. Beaver, S. Micali, and P. Rogaway, "The round complexity of secure protocols (extended abstract)," in STOC, 1990, pp. 503-513.
41. P. Li and S. Zdancewic, "Encoding information flow in Haskell," in CSFW, 2006, p. 16.
42. P. Li and S. Zdancewic, "Arrows for secure information flow," Theor. Comput. Sci., vol. 411, no. 19, pp. 1974-1994, 2010.
43. T.-C. Tsai, A. Russo, and J. Hughes, "A library for secure multi-threaded information flow in Haskell," in CSF, 2007, pp. 187-202.
44. A. Russo, K. Claessen, and J. Hughes, "A library for lightweight information-flow security in Haskell," in Haskell, 2008, pp. 13-24.
45. J. A. Vaughan, "Auraconf: a unified approach to authorization and confidentiality," in TLDI, 2011, pp. 45-58.
46. J. A. Vaughan and S. Zdancewic, "A cryptographic decentralized label model," in IEEE Symposium on Security and Privacy, 2007, pp. 192-206.
47. C. Fournet, J. Planul, and T. Rezk, "Information-flow types for homomorphic encryptions," in ACM Conference on Computer and Communications Security, 2011, pp. 351-360.
48. P. Bogetoft, I. B. Damgard, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft, "Secure computing, economy, and trust: A generic solution for secure auctions with real-world applications," BRICS, Tech. Rep. RS-05-18, 2005.
49. A. Ben-David, N. Nisan, and B. Pinkas, "FairplayMP: a system for secure multi-party computation," in ACM Conference on Computer and Communications Security, 2008, pp. 257-266.
50. D. Bogdanov, S. Laur, and J. Willemson, "Sharemind: A framework for fast privacy-preserving computations," in ES-ORICS, 2008, pp. 192-206.