Browse > Article
http://dx.doi.org/10.13089/JKIISC.2005.15.1.87

Secure Index Searching Schemes for Groups  

Park Hyun-A (CIST(center for information security technology) in Korea University)
Byun Jin-Uk (CIST(center for information security technology) in Korea University)
Lee Hyun-Suk (CIST(center for information security technology) in Korea University)
Lee Dong-Hun (CIST(center for information security technology) in Korea University)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.15, no.1, 2005 , pp. 87-97 More about this Journal
Abstract
A secure index search protocol let us search the index of encrypted documents using the trapdoor for a keyword. It enables an untrusted server to learn nothing more than the search result about the documents without revealing the keyword. A lot of secure search protocols have been suggested but they only considered the search between a single-user and a server. In real organizations such as government offices or enterprises where exist many hierarchical departments, the search system for groups is arisen more often. In this paper, we construct secure index search protocols for hierarchical group settings without re-encryption of the old encrypted documents when group keys are re-keyed newly.
Keywords
Index search; privacy; trapdoor; keyword; encrypted documents;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Song, D. Wagner, and A. Perrig. 'Practical techniques for searches on encrypted data.' In Proceedings of IEEE Symposium on Security and Privacy, pages 44-55. IEEE, May 2000
2 Markus Jakobsson and Ari Juels. 'An Optimally Robust Hybrid Mix Network (Extended Abstract)' In the Proceedings of Principles of Distributed Computing - PODC '01, 2001
3 Y.-C. Chang and M. Mitzenmacher. 'Privacy preserving keyword searches on remote encrypted data.' Cryptology ePrint Archive, Report 2004/051, Feb 2004
4 D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. 'Public-key encryption with keyword search.' In C. Cachin, editor, Proceedings of Eurocrypt 2004, LNCS. Springer-Verlag, May 2004
5 B. Waters, D. Balfanz, G. Durfee, and D. Smetters. 'Building an encrypted and searchable audit log.' In Proceedings of the 11th Network and Distributed System Security (NDSS) Symposium, pages 205-214. Internet Society (ISOC), Feb 2004
6 Eu-Jin Goh. 'Secure Indexes.' A early version of this paper first appeared on the Cryptology ePrint Archive on October 7th 2003. May 5, 2004
7 B. Bloom. 'Space/time trade-offs in hash coding with allowable errors.' Communications of the ACM, 13(7): 422-426, Jul 1970   DOI
8 B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. 'Private information retrieval.' Journal of the ACM, 45(6):965-981, Nov 1998   DOI   ScienceOn
9 S. Bellovin and W. Cheswick. 'Privacy- enhanced searches using encrypted bloom filters.' Cryptology ePrint Archive, Report 2004/022, Feb 2004
10 UC Berkeley|CS 170: Ecient Algorithms and Intractable Problems Handout 10 Lecturer: David Wagner February 27, 2003
11 David Chaum. 'Untraceable electronic mail, return addresses, and digital pseudonyms' In Communications of the ACM 4(2), February 1981