A tale of two clouds: Computing on data encrypted under multiple keys

2014 IEEE Conference on Communications and Network Security, CNS 2014

Volumn , Issue , 2014, Pages 337-345

  Wang, Boyang ^a   Li, Ming ^a   Chow, Sherman S M ^b   Li, Hui ^c  

^a Utah State University ^*  (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c XIDIAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NETWORK SECURITY; NUMBER THEORY;

ARITHMETIC FUNCTIONS; CIPHERTEXTS; DATA COMPUTATION; ENCRYPTED DATA; MULTIPLE KEYS; MULTIPLE USER; PROXY RE ENCRYPTIONS;

DATA MINING;

EID: 84921530000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CNS.2014.6997502     Document Type: Conference Paper

References (38)

1. [Online]. Available: https://immersion.media.mit.edu/
2. D. Song, E. Shi, I. Fischer, and U. Shankar, "Cloud Data Protection for the Masses, " IEEE Computer, vol. 45, no. 1, pp. 39-45, 2012.
3. K. Ren, C. Wang, and Q. Wang, "Security Challenges for the Public Cloud, " IEEE Internet Computing, vol. 16, no. 1, pp. 69-73, 2012.
4. A. López, E. Tromer, and V. Vaikuntanathan, "On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption, " in Proc. of STOC 2012, 2012.
5. C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices, " in Proc. of STOC'09, 2009.
6. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully Homomorphic Encryption over the Integers, " in Proc. of Eurocrypt, 2010, pp. 24-43.
7. Z. Brakerski and V. Vaikuntanathan, "Efficient Fully Homomorphic Encryption from (Standard) LWE, " in Proc. of FOCS'11, 2011.
8. A. Yao, "Protocols for Secure Computations, " in Proc. of FOCS, 1982, pp. 160-164.
9. S. Goldwasser, Y. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zel-dovich, "Reusable Garbled Circuits and Succinct Functional Encryption, " in Proc. of STOC'13, 2013.
10. A. Peter, E. Tews, and S. Katzenbeisser, "Efficiently Outsourcing Multiparty Computation Under Multiple Keys, " IEEE Transactions on Information Forensics and Security, vol. 8, no. 12, pp. 2046-2058, 2013.
11. E. Bresson, D. Catalano, and D. Pointcheval, "A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and Its Applications, " in Proc. of ASIACRYPT'03, 2003, pp. 37-54.
12. G. Ateniese, K. Fu, M. Green, and S. Hohenberger, "Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage, " in Proc. of NDSS'05, 2005.
13. M. van Dijk and A. Juels, "On the Impossibility of Cryptography Alone for Privacy-Preserving Cloud Computing, " in Proc. of HotSec'10. USENIX, 2010, pp. 1-8.
14. Y. Elmehdwi, B. Samanthula, and W. Jiang, "Secure k-Nearest Neighbor Query over Encrypted Data in Outsourced Environments, " in Proc. of IEEE ICDE'14, 2014.
15. H. Chun, Y. Elmehdwi, F. Li, P. Bhattacharya, and W. Jiang, "Outsource-able Two-Party Privacy-Preserving Biometric Authentication, " in Proc. of ACM ASIACCS'14, 2014.
16. B. Wang, M. Li, S. S. M. Chow, and H. Li, "Computing Encrypted Cloud Data Efficiently under Multiple Keys, " in Proc. of CNS-SPCC, 2013.
17. T. Graepel, H. Lauter, and M. Naehrig, "ML Confidential: Machine Learning on Encrypted Data, " in International Conference on Information Security and Cryptography (SECRYPT), 2012.
18. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft, "Privacy-Preserving Ridge Regression on Hundred of Millions of Records, " in Proc. of IEEE S&P'13, 2013.
19. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2009.
20. R. Canetti, "Universally Composable Security: A New Paradigm for Cryptographic Protocols, " in Proc. of FOCS'01, 2001.
21. R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions, " in Proc. of ACM CCS'06, 2006.
22. S. Kamara, C. Papamanthou, and T. Roeder, "Dynamic Searchable Symmetric Encryption, " in Proc. of ACM CCS'12, 2012, pp. 965-976.
23. M. Blaze, G. Bleumer, and M. Strauss, "Divertible Protocols and Atomic Proxy Cryptography, " in Proc. of Eurocrypt, 1998, pp. 127-144.
24. S. S. M. Chow, J. Weng, Y. Yang, and R. H. Deng, "Efficient Unidirectional Proxy Re-Encryption, " in Proc. of AfricaCrypt'10, 2010.
25. Y. Hu, W. J. Martin, and B. Sunar, "Enhanced Flexibility for Homomor-phic Encryption Schemes via CRT, " in Proc. of ACNS'12, 2012.
26. J. M. Pollard, "Monte Carlo Methods for Index Computation mod p, " Mathematics of Computation, vol. 32, no. 143, 918-924 1978.
27. D. Boneh, E.-J. Goh, and K. Nissim, "Evaluating 2-DNF formulas on ciphertexts, " in Proc. of TCC'05, 2005.
28. [Online]. Available: http://crypto.stanford.edu/pbc/
29. O. Goldreich, S. Micali, and A. Wigderson, "How to play ANY mental game, " in Proc. of STOC, 1987, pp. 218-229.
30. D. Chaum, C. Crepeau, and I. Damgård, "Multiparty Unconditionally Secure Protocols, " in Proc. of STOC, 1988, pp. 11-19.
31. R. Bendlin, I. Damgård, C. Orlandi, and S. Zakarias, "Semi-homomorphic Encryption and Multiparty Computation, " in Proc. of Eurocrypt, 2011, pp. 169-188.
32. N. P. Smart and F. Vercauteren, "Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes, " in Proc. of PKC, 2010, pp. 420-443.
33. S. Halevi, Y. Lindell, and B. Pinkas, "Secure Computation on the Web: Computing without Simultaneous Interaction, " in Proc. of CRYPTO'11, 2011, pp. 132-150.
34. S. Kamara, P. Mohassel, and M. Raykova, "Outsourcing Multi-Party Computation, " Available at http://eprint.iacr.org/2011/272.
35. S. Kamara, P. Mohassel, and B. Riva, "Salus: A System for Server-Aided Secure Function Evaluation, " in Proc. of ACM CCS'12, 2012, pp. 797-808.
36. S. S. M. Chow, J.-H. Lee, and L. Subramanian, "Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases, " in Proc. of NDSS'09, 2009.
37. C. Wang, K. Ren, and J. Wang, "Secure and Practical Outsourcing of Linear Programming in Cloud Computing, " in Proc. of INFOCOM, 2011, pp. 820-828.
38. C. Wang, K. Ren, J. Wang, and K. M. R. Urs, "Harnessing the Cloud for Securely Solving Large-scale Systems of Linear Equations, " in Proc. of ICDCS, 2011.