Cart (Loading....) | Create Account
Close category search window
 

Bloom Filter Based Index for Query over Encrypted Character Strings in Database

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lianzhong Liu ; Key Lab. of Beijing Network Technol., Beihang Univ., Beijing, China ; Jingfen Gai

It is important to construct more efficient index used for query over encrypted character strings in database. A few of approaches to deal with such issues have been worked out. In this paper, an bloom filter based index to support fuzzy query over encrypted character data is proposed on the principle of two-phase query. Firstly a triple is used to express a character string, then we use bloom filter compression algorithm on this triple to build encoded index, which will be saved in database as a numeric data. Optimal parameters are selected with the tradeoff between security and efficiency. In this way, the scheme minimizes not-match records by simple bit-and operation on the numeric index. Finally the improved query performance is proofed by experiment result.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:1 )

Date of Conference:

March 31 2009-April 2 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.