Computation Over Encrypted Data

Cloud Computing Security: Foundations and Challenges

Volumn , Issue , 2016, Pages 305-320

  Liu, Feng Hao ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85048803432     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781315372112-38     Document Type: Chapter

References (49)

1. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci, 28(2):270-299, 1984.
2. M. Naor and M. Yung. Public-key cryptosystems prov-ably secure against chosen ciphertext attacks. In 22nd ACM STOC, pages 427-437. ACM Press, 1990.
3. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In 40th FOCS, pages 543-553. IEEE Computer Society Press, 1999.
4. O. Goldreich. Foundations of cryptography: Basic applications, volume 2. Cambridge University Press, Cambridge, UK, 2004.
5. J. Katz and M. Yung. Characterization of security notions for probabilistic private-key encryption. J. Cryptol, 19(1):67-95, 2006.
6. T. ElGamal. On computing logarithms over finite fields. In H. C. Williams, editor, CRYPTO’85, volume 218 of LNCS, pages 396-402. Springer, Heidelberg, 1986.
7. J. Katz and Y. Lindell. Introduction to Modern Cryptography (Second Edition). Chapman and Hall/ CRC Press, 2014.
8. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In J. Stern, editor, EUROCRYPT’99, volume 1592 of LNCS, pages 223-238. Springer, Heidelberg, 1999.
9. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF formulas on ciphertexts. In J. Kilian, editor, TCC 2005, volume 3378 of LNCS, pages 325-341. Springer, Heidelberg, 2005.
10. C. Gentry, A. Sahai, and B. Waters. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In R. Canetti and J. A. Garay, editors, CRYPTO 2013, Part I, volume 8042 of LNCS, pages 75-92. Springer, Heidelberg, 2013.
11. D. Boneh and M. K. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, CRYPTO 2001, volume 2139 of LNCS, pages 213-229. Springer, Heidelberg, 2001.
12. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
13. T. Okamoto and S. Uchiyama. A new public-key cryptosystem as secure as factoring. In K. Nyberg, editor, EUROCRYPT’98, volume 1403 of LNCS, pages 308-318. Springer, Heidelberg, 1998.
14. R. L. Rivest, L. Adleman, and M. L. Dertouzos. On data banks and privacy homomorphisms. Foundations of Secure Computation, 1978.
15. C. Gentry. Fully homomorphic encryption using ideal lattices. In M. Mitzenmacher, editor, 41st ACM STOC, pages 169-178. ACM Press, 2009.
16. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully homomorphic encryption over the integers. In H. Gilbert, editor, EUROCRYPT 2010, volume 6110 of LNCS, pages 24-43. Springer, Heidelberg, 2010.
17. Z. Brakerski. Fully homomorphic encryption without modulus switching from classical GapSVP. In R. Safavi-Naini and R. Canetti, editors, CRYPTO 2012, volume 7417of LNCS, pages 868-886. Springer, Heidelber, 2012.
18. Z. Brakerski, C. Gentry, and V. Vaikuntanathan. (Leveled) Fully homomorphic encryption without bootstrapping. In S. Goldwasser, editor, ITCS 2012, pages 309-325. ACM, 2012.
19. Z. Brakerski and V. Vaikuntanathan. Efficient fully homomorphic encryption from (standard) LWE. In R. Ostrovsky, editor, 52nd FOCS, pages 97-106. IEEE Computer Society Press, 2011.
20. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In H. N. Gabow and R. Fagin, editors, 37th ACM STOC, pages 84-93. ACM Press, 2005.
21. C. Peikert. Public-key cryptosystems from the worst-case shortest vector problem: Extended abstract. In M. Mitzenmacher, editor, 41st ACM STOC, pages 333-342. ACM Press, 2009.
22. J. Black, P. Rogaway, and T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages. In K. Nyberg and H. M. Heys, editors, SAC 2002, volume 2595 of LNCS, pages 62-75. Springer, Heidelberg, 2003.
23. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In B. Pfitzmann, editor, EUROCRYPT2001, volume 2045 of LNCS, pages 93-118. Springer, Heidelberg, 2001.
24. D. Micciancio and C. Peikert. Trapdoors for lattices: Simpler, tighter, faster, smaller. In D. Pointcheval and T. Johansson, editors, EUROCRYPT 2012, volume 7237 of LNCS, pages 700-718. Springer, Heidelberg, 2012.
25. P. Mukherjee and D. Wichs. Two round MPC from LWE via multi-key FHE. Cryptology ePrint Archive, Report 2015/345, 2015. Available at http://eprint.iacr.org/2015/345.
26. J. Alperin-Sheriff and C. Peikert. Faster bootstrapping with polynomial error. In J. A. Garay and R. Gennaro, editors, CRYPTO 2014, Part I, volume 8616 of LNCS, pages 297-314. Springer, Heidelberg, 2014.
27. A. Sahai and B. R. Waters. Fuzzy identity-based encryption. In R. Cramer, editor, EUROCRYPT 2005, volume 3494 of LNCS, pages 457-473. Springer, Heidelberg, 2005.
28. D. Boneh, A. Sahai, and B. Waters. Functional encryption: Definitions and challenges. In Y. Ishai, editor, TCC 2011, volume 6597 of LNCS, pages 253-273. Springer, Heidelberg, 2011.
29. A. O’Neill. Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010/556, 2010. Available at http://eprint.iacr.org/2010/556.
30. A. Sahai and H. Seyalioglu. Worry-free encryption: Functional encryption with public keys. In E. Al-Shaer, A. D. Keromytis, and V. Shmatikov, editors, ACM CCS 10, pages 463-472. ACM Press, 2010.
31. A. C.-C. Yao. How to generate and exchange secrets (extended abstract). In 27th FOCS, pages 162-167. IEEE Computer Society Press, 1986.
32. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in nc0. SIAM J. Comput, 36(4):845-888, 2006.
33. M. Bellare, V. T. Hoang, and P. Rogaway. Foundations of garbled circuits. In T. Yu, G. Danezis, and V. D. Gligor, editors, ACM CCS 12, pages 784-796. ACM Press, 2012.
34. S. Goldwasser, Y. T. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich. Reusable garbled circuits and succinct functional encryption. In D. Boneh, T. Roughgarden, and J. Feigenbaum, editors, 45th ACM STOC, pages 555-564. ACM Press, 2013.
35. S. Gorbunov, V. Vaikuntanathan, and H. Wee. Functional encryption with bounded collusions via multi-party computation. In R. Safavi-Naini and R. Canetti, editors, CRYPTO 2012, volume 7417 of LNCS, pages 162-179. Springer, Heidelberg, 2012.
36. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, Sahai, S. P. Vadhan, and K. Yang. On the (impossibility of obfuscating programs. J. ACM., 59(2):6, 2012.
37. H. Wee. On obfuscating point functions. In H. N. Gabow and R. Fagin, editors, 37th ACM STOC, pages 523-532. ACM Press, 2005.
38. S. Goldwasser and G. N. Rothblum. On best-possible obfuscation. In S. P. Vadhan, editor, TCC 2007, volume 4392 of LNCS, pages 194-213. Springer, Heidelberg, 2007.
39. S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, and B. Waters. Candidate indistinguishability obfuscation and functional encryption for all circuits. In 54th FOCS, pages 40-49. IEEE Computer Society Press, 2013.
40. A. Sahai and B. Waters. How to use indistinguishabil-ity obfuscation: Deniable encryption, and more. In D. B. Shmoys, editor, 46th ACM STOC, pages 475-484. ACM Press, 2014.
41. S. Goldwasser, S. D. Gordon, V. Goyal, A. Jain, J. Katz, F.-H. Liu, A. Sahai, E. Shi, and H.-S. Zhou. Multi-input functional encryption. In P. Q. Nguyen and E. Oswald, editors, EUROCRYPT2014, volume 8441 of LNCS, pages 578-602. Springer, Heidelberg, 2014.
42. V. Goyal, O. Pandey, A. Sahai, and B. Waters. Attribute-based encryption for fine-grained access control of encrypted data. In A. Juels, R. N. Wright, and S. Vimercati, editors, ACM CCS 06, pages 89-98. ACM Press, 2006. Available as Cryptology ePrint Archive Report 2006/309.
43. S. D. Gordon, J. Katz, F.-H. Liu, E. Shi, and H.-S. Zhou. Multi-client verifiable computation with stronger security guarantees. In Y. Dodis and J. B. Nielsen, editors, TCC 2015, Part II, volume 9015 of LNCS, pages 144-168. Springer, Heidelberg, 2015.
44. B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In R. Cramer, editor, TCC 2012, volume 7194 of LNCS, pages 422-439. Springer, Heidelberg, 2012.
45. A. Boldyreva, N. Chenette, Y. Lee, and A. O’Neill. Order-preserving symmetric encryption. In A. Joux, editor, EUROCRYPT 2009, volume 5479 of LNCS, pages 224-241. Springer, Heidelberg, 2009.
46. A. Boldyreva, N. Chenette, and A. O’Neill. Order-preserving encryption revisited: Improved security analysis and alternative solutions. In P. Rogaway, editor, CRYPTO 2011, volume 6841 of LNCS, pages 578-595. Springer, Heidelberg, 2011.
47. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In A. Aho, editor, 19th ACM STOC, pages 218-229. ACM Press, 1987.
48. A. C.-C. Yao. Protocols for secure computations (extended abstract). In 23rd FOCS, pages 160-164. IEEE Computer Society Press, 1982.
49. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan. CryptDB: Protecting confidentiality with encrypted query processing. In T. Wobber and P. Druschel, editors, Proceedings of the 23rd ACM Symposium on Operating Systems Principles 2011, SOSP 2011, Cascais, Portugal, October 23-26, 2011, pages 85-100. ACM, 2011.