Proceedings Article10.1145/564691.564717
Executing SQL over encrypted data in the database-service-provider model
Hakan Hacigumus,Bala Iyer,Chen Li,Sharad Mehrotra +3 more
- 03 Jun 2002
- pp 216-227
1.4K
TL;DR: The paper explores an algebraic framework to split the query to minimize the computation at the client site, and explores techniques to execute SQL queries over encrypted data.
read more
Abstract: Rapid advances in networking and Internet technologies have fueled the emergence of the "software as a service" model for enterprise computing. Successful examples of commercially viable software services include rent-a-spreadsheet, electronic mail services, general storage services, disaster protection services. "Database as a Service" model provides users power to create, store, modify, and retrieve data from anywhere in the world, as long as they have access to the Internet. It introduces several challenges, an important issue being data privacy. It is in this context that we specifically address the issue of data privacy.There are two main privacy issues. First, the owner of the data needs to be assured that the data stored on the service-provider site is protected against data thefts from outsiders. Second, data needs to be protected even from the service providers, if the providers themselves cannot be trusted. In this paper, we focus on the second challenge. Specifically, we explore techniques to execute SQL queries over encrypted data. Our strategy is to process as much of the query as possible at the service providers' site, without having to decrypt the data. Decryption and the remainder of the query processing are performed at the client site. The paper explores an algebraic framework to split the query to minimize the computation at the client site. Results of experiments validating our approach are also presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Order preserving encryption for numeric data
Rakesh Agrawal,Jerry Kiernan,Ramakrishnan Srikant,Yirong Xu +3 more
- 13 Jun 2004
TL;DR: This work presents an order-preserving encryption scheme for numeric data that allows any comparison operation to be directly applied on encrypted data, and is robust against estimation of the true value in such environments.
CryptDB: protecting confidentiality with encrypted query processing
Raluca Ada Popa,Catherine M. S. Redfield,Nickolai Zeldovich,Hari Balakrishnan +3 more
- 23 Oct 2011
TL;DR: The evaluation shows that CryptDB has low overhead, reducing throughput by 14.5% for phpBB, a web forum application, and by 26% for queries from TPC-C, compared to unmodified MySQL.
Scalable and efficient provable data possession
Giuseppe Ateniese,Roberto Di Pietro,Luigi V. Mancini,Gene Tsudik +3 more
- 22 Sep 2008
TL;DR: In this article, a provably secure storage outsourced data possession (PDP) technique based on symmetric key cryptography was proposed, which allows outsourcing of dynamic data, such as block modification, deletion and append.
1.3K
Secure kNN computation on encrypted databases
Wai Kit Wong,David W. Cheung,Ben Kao,Nikos Mamoulis +3 more
- 29 Jun 2009
TL;DR: A new asymmetric scalar-product-preserving encryption (ASPE) that preserves a special type of scalar product and is shown to resist practical attacks of a different background knowledge level, at a different overhead cost.
Deterministic and efficiently searchable encryption
Mihir Bellare,Alexandra Boldyreva,Adam O'Neill +2 more
- 19 Aug 2007
TL;DR: This work obtains as a consequence database encryption methods that permit fast database search while provably providing privacy that is as strong as possible subject to this fast search constraint.
References
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
A Method for Obtaining Digital Signatures and Public Key Cryptosystems (Formerly on Digital Signatures and Public Key Cryptosystems)
Ronald L. Rivest,Adi Shamir,Len Adelman +2 more
- 01 Jan 1977
TL;DR: In this paper, a message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q.
8.2K
Practical techniques for searches on encrypted data
Dawn Song,David Wagner,Adrian Perrig +2 more
- 14 May 2000
TL;DR: This work describes the cryptographic schemes for the problem of searching on encrypted data and provides proofs of security for the resulting crypto systems, and presents simple, fast, and practical algorithms that are practical to use today.
On data banks and privacy homomorphisms
Ronald L. Rivest,Michael L. Dertouzos +1 more
- 01 Jan 1978
TL;DR: It appears likely that there exist encryption functions which permit encrypted data to be operated on without preliminary decryption of the operands, for many sets of interesting operations.
•Book
Database System Concepts
Henry F. Korth,Abraham Silberschatz +1 more
- 01 Jan 1980
TL;DR: This acclaimed revision of a classic database systems text provides the latest information combined with real-world examples to help readers master concepts in a technically complete yet easy-to-understand style.
2.1K
Related Papers (5)
Rakesh Agrawal,Jerry Kiernan,Ramakrishnan Srikant,Yirong Xu +3 more
- 13 Jun 2004
Dawn Song,David Wagner,Adrian Perrig +2 more
- 14 May 2000
Craig Gentry
- 31 May 2009