Abstract
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.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellovin, S., Cheswick, W.: Privacy-enhanced searches using encrypted bloom filters. Cryptology ePrint Archive, Report 2004/022 (Feburary 2004)
Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004)
Burrnesterand, M., Desmedt, Y.: A secure and efficient conference key distribution system. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)
Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACMÂ 4(2) (February 1981)
Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. Journal of the ACM 45(6), 965–981 (1998)
Chang, Y.-C., Mitzenmacher, M.: Privacy preserving keyword searches on remote encrypted data. Cryptology ePrint Archive, Report 2004/051 (February 2004)
DÃaz, C., Serjantov, A.: Generalising mixes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 18–31. Springer, Heidelberg (2003)
Goh, E.-J.: Secure Indexes. An early version of this paper first appeared on the Cryptology ePrint Archive on October 7th 2003 (May 5, 2004)
Perrig, A., Canetti, R., Tygar, J., Song, D.X.: Efficient authentication and signing of multicast streams over lossy channels. In: IEEE Symposium on Security and Privacy (May 2000)
Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 44–55. IEEE, Los Alamitos (2000)
UC Berkeley|CS 170: Ecient Algorithms and Intractable Problems Handout 10 Lecturer: David Wagner (February 27, 2003)
Waters, B., Balfanz, D., Durfee, G., Smetters, D.: Building an encrypted and searchable audit log. In: Proceedings of the 11th Network and Distributed System Security (NDSS) Symposium, Internet Society (ISOC), pp. 205–214 (February 2004)
Hu, Y.-C., Perrig, A., Johnson, D.B.: Efficient security mechanisms for routing protocols. In: Network and Distributed System Security Symposium, NDSS 2003, pp. 57–73 (February 2003)
Perrig, A., Song, D., Tygar, J.D.: ELK, a new protocol for efficient large-group key distribution. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 247–262 (2001)
Jakobsson, M., Juels, A.: Mix and match: Secure function evaluation via ciphertexts. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 162–177. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, HA., Byun, J.W., Lee, D.H. (2005). Secure Index Search for Groups. In: Katsikas, S., López, J., Pernul, G. (eds) Trust, Privacy, and Security in Digital Business. TrustBus 2005. Lecture Notes in Computer Science, vol 3592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11537878_14
Download citation
DOI: https://doi.org/10.1007/11537878_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28224-2
Online ISBN: 978-3-540-31796-8
eBook Packages: Computer ScienceComputer Science (R0)