Oblivious conjunctive keyword search

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3786 LNCS, Issue , 2005, Pages 318-327

  Rhee, Hyun Sook ^a   Byun, Jin Wook ^a   Lee, Dong Hoon ^a   Lim, Jongin ^a  

^a Korea University   (South Korea)

Author keywords

Anonymity; Conjunctive Keyword Search; Oblivious Transfer; Privacy; Storage system

Indexed keywords

INVERSE PROBLEMS; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; QUERY LANGUAGES; SERVERS;

ANONYMITY; CONJUNCTIVE KEYWORD SEARCH; OBLIVIOUS TRANSFER; PRIVACY; STORAGE SYSTEM;

INFORMATION RETRIEVAL;

EID: 33744903955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. R. Agrawal and R. Srikant,"Privacy-Preserving Data Mining", In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 439-450, 2000.
2. M. Balze, "A Cryptographic file system for UNIX.", Processings of 1st ACM Conference om Communications and Computing Security, 1993.
3. S. Bellovin, W. Cheswick, "Privacy-enhanced searches using encrypted bloom filters", Cryptology ePrint Archive, Report 2004/022, Feb 2004.
4. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, "Public key Encryption with Keyword Search", EUROCRYPT'04, 2004.
5. D. Brassard, C. Crepeau, and J. M. Robert, "All-or-Nithing Disclosure of Secrets", Crypto'86, Springer-Verlag, 1987, pp. 234-238.
6. M. Bellare, C. Namprempre, and D. Pioncheval,"The Power of RSA Onversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme", Proc. of Finandcial Cryptography 2001, LNCS vol. 2339, pp. 319-338.
7. Y. C. Chang, M. Mitzenmacher, "privacy preserving keyword searches on remote encrypted data",ePrint, October 7th 2003.
8. G. Cattaneo, G. Persiano, A. Del Sorbo, A. Cozzolino, E. Mauriello, and R. Pisapia, "Design and implementation of a transparent cryptographic file system for UNIX", Techincal Report, University of Salerno, 1997.
9. S. Even, O. Goldreich, and A. Lempel, "A Randomized Protocol for Signing Contracts", comm. of ACM, 28:637-647, 1985.
10. E. J. Goh, "secure index", ePrint, October 7th 2003.
11. P. Golle, M. Jakobsson, A. Juels, and Paul Syverson, "Universal Re-encryption for Mixnets", In proceedings of CT-RSA 2004, 2004.
12. P. Golle, J. Staddon and B. Waters, "Secure Conjunctive Keyword Search Over Encrypted Data", Proceedings of the Second International Conference on ACNS:Applied Cryptography and Network Security, 2004.
13. J. Hughes and D. Corcoran, "A nuiversal access, smart-card-based, secure fiel system.", Atlanta Linux Showcase, October 1999.
14. A. John, R. Peter, "Electric Communication Development", Communications of the ACM, 40, May 1997, pp. 71-79. 48-63, 2002.
15. K. Kurosawa, "Multi-recipient Public-Key Encryption with Shortened Ciphertext", In proceedings of PKC 2002, LNCS 2274, pp. 48-63, 2002.
16. M. Noar and B. Pinkas, "Efficient Oblivious trnasfer protocols", 12th Annual Symposium on Discrete Algorithms (SODA), pp 448-457(2001).
17. W. Ogata and K. Kurosawa, "Oblivious Keyword Search", Journal of complexity'04, Vol 20, April/Jun 2004.
18. D. Park, K. Kim, and P. Lee, "Public key Encryption with Conjunctive Field Keyword Search", WISA'04, LNCS 3325, pp73-86, 2004.
19. D. Pointcheval and J. P. Stern, "Provably secure blind signature schemes", Proc. of Asiacrypt'96, LNCS Vol. 1163, pp 252-265, 1996.
20. M. Rabin, "How to exchange secrets by oblivious transfer", Technical Report TR 81, Aiken computation Lab, Harvard University.
21. D. Song, D. Wagner, and A. Perrige, "Practical Techniques for searches on Encrypted Data", In Proc. of the 2000 IEEE Security and Privacy Symposium, May 2000,
22. B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters, "Building an Encrypted and Searchable Audit Log", 11th Annual Network and Distributed Security Symposium (NDSS '04); 2004.
23. E. Zadok, I, Badulescu, and A, Shender, "Cryptfs: A stackable vnode level encryption fiel system.", Technical Report CUCS-021-98: 1998.