Computing encrypted cloud data efficiently under multiple keys

2013 IEEE Conference on Communications and Network Security, CNS 2013

Volumn , Issue , 2013, Pages 504-513

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

^a XIDIAN UNIVERSITY   (China)

^b Department of Computer Science Utah State University ^*  (United States)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK SECURITY;

DATA AGGREGATION; EFFICIENT SCHEMES; MINIMAL INTERACTIONS; POLYNOMIAL FUNCTIONS; PRIVACY CONCERNS; PRIVACY PRESERVING; SECURE COMPUTATION; SMART METERING;

CRYPTOGRAPHY;

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

References (24)

1. A. Yao, "Protocols for Secure Computations," in FOCS, 1982, pp. 160-164.
2. O. Goldreich, S. Micali, and A. Wigderson, "How to play ANY mental game," in STOC, 1987, pp. 218-229.
3. D. Chaum, C. Crepeau, and I. Damgård, "Multiparty Unconditionally Secure Protocols," in STOC, 1988, pp. 11-19.
4. S. G. Choi, A. Elbaz, A. Juels, T. Malkin, and M. Yung, "Two-party Computing with Encrypted Data," in ASIACRYPT, 2007, pp. 298-314.
5. Y. Lindell and B. Pinkas, "An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries," in EUROCRYPT, 2007, pp. 52-78.
6. R. Bendlin, I. Damgård, C. Orlandi, and S. Zakarias, "Semihomomorphic Encryption and Multiparty Computation," in EUROCRYPT, 2011, pp. 169-188.
7. S. Goldwasser, Y. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich, "Reusable Garbled Circuits and Succinct Functional Encryption," in STOC, 2013.
8. S. Halevi, Y. Lindell, and B. Pinkas, "Secure Computation on the Web: Computing without Simultaneous Interaction," in CRYPTO, 2011, pp. 132-150.
9. C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices," in STOC, 2009.
10. M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan, "Fully Homomorphic Encryption over the Integers," in EUROCRYPT, 2010, pp. 24-43.
11. Z. Brakerski, C. Gentry, and V. Vaikuntanathan, "(Leveled) Fully Homomorphic Encryption without Bootstrapping," in ITCS, 2012.
12. A. López, E. Tromer, and V. Vaikuntanathan, "On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption," in STOC, 2012.
13. A. Peter, E. Tews, and S. Katzenbeisser, "Efficiently Outsourcing Multiparty Computation under Multiple Keys," http://eprint.iacr.org/2013/ 013.
14. M. Blaze, G. Bleumer, and M. Strauss, "Divertible Protocols and Atomic Proxy Cryptography," in EUROCRYPT, 1998, pp. 127-144.
15. S. S. M. Chow, J.-H. Lee, and L. Subramanian, "Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases," in NDSS, 2009.
16. S. Kamara, P. Mohassel, and M. Raykova, "Outsourcing Multi-Party Computation," http://eprint.iacr.org/2011/272.
17. V. Nikolaenko, U. Weinsberg, S. Ioannidis, M. Joye, D. Boneh, and N. Taft, "Privacy-Preserving Ridge Regression on Hundred of Millions of Records," in IEEE S&P, 2013.
18. M. van Dijk and A. Juels, "On the Impossibility of Cryptography Alone for Privacy-Preserving Cloud Computing," in HotSec. USENIX, 2010, pp. 1-8.
19. E. Shi, T.-H. H. Chan, E. Rieffel, R. Chow, and D. Song, "Privacy- Preserving Aggregation of Time-Series Data," in NDSS, 2011.
20. Q. Li and G. Cao, "Efficient and Privacy-Preserving Data Aggregation in Mobile Sensing," in ICNP, 2012.
21. T. ElGamal, "A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," IEEE Transactions on Information Theory, vol. 31, no. 4, pp. 469-472, 1985.
22. J. M. Pollard, "Monte Carlo Methods for Index Computation mod p," Mathematics of Computation, vol. 32, no. 143, 918-924 1978.
23. O. Goldreich, Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press, 2009.
24. T. Graepel, H. Lauter, and M. Naehrig, "ML Confidential: Machine Learning on Encrypted Data," in International Conference on Information Security and Cryptography (SECRYPT), 2012.