Secure index search for groups

Lecture Notes in Computer Science

Volumn 3592, Issue , 2005, Pages 128-140

  Park, Hyun A ^a   Byun, Jin Wook ^a   Lee, Dong Hoon ^a  

^a Korea University   (South Korea)

Author keywords

Database; Hierarchical group; Index search; Keyword; Privacy

Indexed keywords

CRYPTOGRAPHY; PROBLEM SOLVING; SERVERS; SOCIETIES AND INSTITUTIONS;

INDEX SEARCH PROTOCOL; REENCRYPTIONS; SEARCH PROTOCOLS; SERVER STORING;

SEARCH ENGINES;

EID: 26844445270     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537878_14     Document Type: Conference Paper

References (16)

1. S. Bellovin and W. Cheswick. Privacy-enhanced searches using encrypted bloom filters. Cryptology ePrint Archive, Report 2004/022, Feb 2004.
2. 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.
3. M. Burrnesterand Y. Desmedt. A secure and efficient conference key distribution system. The Advances in Cryptology - EUROCRYPT, 1994
4. B. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, Jul 1970.
5. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM 4(2), February 1981.
6. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. Journal of the ACM, 45(6):965-981, Nov 1998.
7. Y.-C. Chang and M. Mitzenmacher. Privacy preserving keyword searches on remote encrypted data. Cryptology ePrint Archive, Report 2004/051, Feb 2004.
8. Claudia Diaz and Andrei Serjantov. Generalising Mixes. In the Proceedings of Privacy Enhancing Technologies workshop (PET 2003), March 2003.
9. Eu-Jin Goh. Secure Indexes. An early version of this paper first appeared on the Cryptology ePrint Archive on October 7th 2003. May 5, 2004
10. A. Perrig, R. Canetti, J. Tygar, and D. X. Song. Efficient authentication and signing of multicast streams over lossy channels. In IEEE Symposium on Security and Privacy, May 2000.
11. 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.
12. UC Berkeley - CS 170: Ecient Algorithms and Intractable Problems Handout 10 Lecturer: David Wagner February 27, 2003
13. 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.
14. Yih-Chun Hu, Adrian Perrig, and David B. Johnson. Efficient security mechanisms for routing protocols. In Network and Distributed System Security Symposium, NDSS03, pages 57-73, February 2003.
15. A. Perrig, D. Song, and J.D. Tygar. ELK, a new protocol for efficient large-group key distribution. In Proceedings of IEEE Symposium on Security and Privacy, pages 247-262, 2001.
16. M.Jakobsson and A. Juels. Mix and Match: Secure Function Evaluation via Ciphertexts. ASIACRYPT2000, LNCS 1976, pages 162-177, 2000.