Computing encrypted cloud data efficiently under multiple keys

Boyang Wang, Ming Li, Sherman S.M. Chow, Hui Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Scopus citations

Abstract

The emergence of cloud computing brings users abundant opportunities to utilize the power of cloud to perform computation on data contributed by multiple users. These cloud data should be encrypted under multiple keys due to privacy concerns. However, existing secure computation techniques are either limited to single key or still far from practical. In this paper, we design two efficient schemes for secure outsourced computation over cloud data encrypted under multiple keys. Our schemes employ two non-colluding cloud servers to jointly compute polynomial functions over multiple users' encrypted cloud data without learning the inputs, intermediate or final results, and require only minimal interactions between the two cloud servers but not the users. We demonstrate our schemes' efficiency experimentally via applications in machine learning. Our schemes are also applicable to privacy-preserving data aggregation such as in smart metering.

Original languageEnglish (US)
Title of host publication2013 IEEE Conference on Communications and Network Security, CNS 2013
PublisherIEEE Computer Society
Pages504-513
Number of pages10
ISBN (Print)9781479908950
DOIs
StatePublished - 2013
Externally publishedYes
Event1st IEEE International Conference on Communications and Network Security, CNS 2013 - Washington, DC, United States
Duration: Oct 14 2013Oct 16 2013

Publication series

Name2013 IEEE Conference on Communications and Network Security, CNS 2013

Other

Other1st IEEE International Conference on Communications and Network Security, CNS 2013
Country/TerritoryUnited States
CityWashington, DC
Period10/14/1310/16/13

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this