Journal of the ACM (JACM)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Mix and Match: Secure Function Evaluation via Ciphertexts
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
ELK, a New Protocol for Efficient Large-Group Key Distribution
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Information Security Applications
Common secure index for conjunctive keyword-based retrieval over encrypted data
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Threshold privacy preserving keyword searches
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Hi-index | 0.00 |
A secure index search protocol makes it possible to search for the index of encrypted documents using specified keywords even without decrypting them. An untrusted server storing the documents learns nothing more than the search result about the documents without revealing the keyword. Secure index search protocols in the literature only consider a search process between a single-user and a server. However, in real organizations such as government offices or enterprises with many departments, a group search occurs more often. In this paper, we study natural extension of previous results, i.e., secure index search between a server and group members, where a file may be shared by a group or a person with a server. The difficulty in designing such a group setting arises from dynamic group, where each member of the group may join to or leave from the group. To resolve this difficulty efficiently, we propose novel secure index search protocols without re-encryption of the old encrypted documents when group keys are updated.