A Performance Test of Query Operation on Encrypted Database
Database security techniques are available widely. Among those techniques, the encryption method is a well-certified and established technology for protecting sensitive data. However, once encrypted, the data can no longer be easily queried. The performance of the database depends on how to encrypt the sensitive data, and an approach for searching and retrieval efficiencies that are implemented. In this paper we analyze the database queries and the data properties and propose a suitable mechanism to query the encrypted database. We proposed and analyzed the new database encryption algorithm using the Bloom Filter with the bucket index method. Finally, we demonstrated the superiority of the proposed algorithm through several experiments that should be useful for database encryption related research and application activities.
KeywordsBloom filter Bucket index Database Encrypted database
This research presented in this paper is supported by the Ministry of Education and Science Technology of Korea (No. 2010-0023648).
- 1.Hacıgümüş H, Iyer B, Li C, Mehrotra S (2002) Executing SQL over encrypted data in the database service provider model. In Proceedings of the ACM SIGMODGoogle Scholar
- 2.Damiani E, De Capitani di Vimercati S, Jajordia S (2003) Balancing confidentiality and efficiency in untrusted relational DBMSs. In: Proceedings of the 10th ACM (CCS03), USA, ACM, 93Google Scholar
- 3.Hacigumus H, Iyer B, Mehrotra S (2004) Efficient execution of aggregation queries over encrypted relational databases, vol 2973. LNCS, Springer, Jeju IslandGoogle Scholar
- 4.Agrawal R, Kiernan J, Srikant R, Xu Y (2004) Order preserving encryption for numerical data. In: Proceedings of the ACM SIGMOD 2004, ACM, Paris, p 563Google Scholar
- 5.Bouganim L, GUO Y Database encryption. www-smis.inria.fr
- 6.De Capitani di Vimercati S, Foresti S, Jajodia S, Paraboschi S, Samarati P (2010) Privacy of outsourced data. IFIP Advances in Information and Communication Technology. Auerbach Publications (Taylor and Francis Group) 320:174–187Google Scholar