Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A privacy-preserving index for range queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Answering aggregation queries in a secure system model
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Privacy-preserving queries on encrypted data
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Query log perturbation method for privacy preserving query
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
A low cost privacy protection method for SNS by using Bloom filter
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Proposal of privacy protection system for web forms using Bloom filter
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Secure keyword search using bloom filter with specified character positions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
| Hi-index | 0.00 |
Recently, Database-As-a-Service (DAS) has attracted considerable attention. Users require protecting sensitive data from the DAS administrators. Most of previous studies, which proposed the solutions using cryptographic techniques, assume that a large amount of data will be inserted into the database and new data will be uploaded infrequently. We propose a secure query execution model for such an environment. Our approach is to represent all schemes of each tuple in a plaintext table as one Bloom filter index, and to replace queries with keyword searches of the Bloom filter index. Same values in each tuple are transformed into different values by two-phase encryption. DAS administrators cannot determine the schemes of the original table even if they look view the database and queries. Therefore, our approach is robust against the estimation of schemes in original tables.