Searchable encryption for outsourced data analytics

Kerschbaum, Florian; Sorniotti, Alessandro
EUROPKI 2010, 7th European conference on Public key infrastructures, services and applications, September 23-24, 2010, Athens, Greece / Also published in "Lecture Notes in Computer Science", 2011, Volume 6711/2011

Two sets of privacy requirements need to be fulfilled when a company’s accounting data is audited by an external party: the company needs to safeguard its data, while the auditors do not want to reveal their investigation methods. This problem is usually addressed by physically isolating data and auditors during the course of an audit. This approach however no longer works when auditing is performed remotely.

In this paper we present an efficient construction for a searchable encryption scheme for outsourcing data analytics. In this scheme the data owner needs to encrypt his data only once and ship it in encrypted form to the data analyst. The data analyst can then perform a series of queries for which he must ask the data owner for help in translating the constants in the queries.

Our searchable encryption scheme extends previous work by the ability to re-use query results as search tokens (query-result reusability) and the ability to perform range queries. It is efficient with O(log2 n) work for a range query and is semantically secure relying only on Diffie-Hellman assumptions (in the random oracle model).


DOI
Type:
Conférence
City:
Athens
Date:
2010-09-23
Department:
Sécurité numérique
Eurecom Ref:
3528
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in EUROPKI 2010, 7th European conference on Public key infrastructures, services and applications, September 23-24, 2010, Athens, Greece / Also published in "Lecture Notes in Computer Science", 2011, Volume 6711/2011 and is available at : http://dx.doi.org/10.1007/978-3-642-22633-5_5

PERMALINK : https://www.eurecom.fr/publication/3528