By Topic

Efficient keyword index search over encrypted documents of groups

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
$33 $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

4 Author(s)
Hyun-A Park ; CIST(Center for the information security technologies), Korea University, Korea ; Dong Hoon Lee ; Justin Zhan ; Gary Blosser

In a real world, it is often in a group setting that sensitive information has to be stored in databases of a server. Although personal information does not need to be stored in a server, the secret information shared by group members is likely to be stored there. The shared sensitive information requires more security and privacy protection. To our best knowledge, there is no paper which deals with applicable group search schemes to a real world over encrypted data. In this paper, we propose two schemes which can search the encrypted documents without re-encrypting all documents in a server even if group keys have to be updated. The schemes can support general database normalization for encrypted database. Our experiments show that our schemes are much more efficient than the existing schemes.

Published in:

Intelligence and Security Informatics, 2008. ISI 2008. IEEE International Conference on

Date of Conference:

17-20 June 2008