Abstract

Encryption is an efficient way of protecting database security. Traditional keyword based queries cannot be executed directly over encrypted databases. An encrypted keyword search method is presented based on the bloom filter mechanism. Keywords are mapped into a bloom filter array, which are attached to database tables and stored as string fields in the tables. When processing queries, the bit-array and the encrypted index are compared, then the query can be carried out against encrypted fields. The principle of bloom filter is introduced together with its error analysis. We also implement multiple hash functions as the building block of our design. Finally, we make an extension of the current SQL in our system by creating user-defined functions and CRL assemblies. The prototype of our design is implemented on a SQL Server database. Experiment results show that our method is efficient and highly applicable.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.