DMCA
Order Preserving Encryption for Numeric Data (2004)
Cached
Download Links
| Citations: | 210 - 2 self |
BibTeX
@MISC{Agrawal04orderpreserving,
author = {Rakesh Agrawal and Jerry Kiernan and Ramakrishnan Srikant and Yirong Xu},
title = { Order Preserving Encryption for Numeric Data},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Encryption is a well established technology for protecting sensitive data. However, once encrypted, data can no longer be easily queried aside from exact matches. We present an order-preserving encryption scheme for numeric data that allows any comparison operation to be directly applied on encrypted data. Query results produced are sound (no false hits) and complete (no false drops). Our scheme handles updates gracefully and new values can be added without requiring changes in the encryption of other values. It allows standard database indexes to be built over encrypted tables and can easily be integrated with existing database systems. The proposed scheme has been designed to be deployed in application environments in which the intruder can get access to the encrypted database, but does not have prior domain information such as the distribution of values and cannot encrypt or decrypt arbitrary values of his choice. The encryption is robust against estimation of the true value in such environments.
Keyphrases
numeric data application environment encrypted table order-preserving encryption scheme encrypted data true value query result encrypted database standard database index exact match cannot encrypt false hit comparison operation decrypt arbitrary value new value false drop database system sensitive data
