Secure Conjunctive Keyword Search over Encrypted Data

作者: Philippe Golle , Jessica Staddon , Brent Waters

DOI: 10.1007/978-3-540-24852-1_3

关键词:

摘要: We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve satisfying certain search criterion, gives server capability that allows identify exactly those documents. Work this area has largely focused criteria consisting of single keyword. If is actually interested containing each several keywords (conjunctive keyword search) must either give capabilities for individually and rely intersection calculation (by or user) determine correct set documents, alternatively, may store additional information facilitate such searches. Neither solution desirable; former enables learn match individual conjunctive latter results exponential storage if searches every keywords.

参考文章(19)
Diana K. Smetters, Brent R. Waters, Dirk Balfanz, Glenn Durfee, Building an Encrypted and Searchable Audit Log. network and distributed system security symposium. ,(2004)
Moni Naor, Niv Gilboa, Benny Chor, Private Information Retrieval by Keywords CTIT technical reports series. ,(1997)
Jeffrey Shallit, Eric Bach, Algorithmic number theory MIT Press. ,(1996)
Dan Boneh, The Decision Diffie-Hellman Problem algorithmic number theory symposium. pp. 48- 63 ,(1998) , 10.1007/BFB0054851
Antoine Joux, The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems algorithmic number theory symposium. ,vol. 2369, pp. 20- 32 ,(2002) , 10.1007/3-540-45455-1_3
Krista Bennett, Christian Grothoff, Tzvetan Horozov, Ioana Patrascu, Efficient Sharing of Encrypted Data australasian conference on information security and privacy. pp. 107- 120 ,(2002) , 10.1007/3-540-45450-0_8
Christian Cachin, Silvio Micali, Markus Stadler, None, Computationally private information retrieval with polylogarithmic communication theory and application of cryptographic techniques. pp. 402- 414 ,(1999) , 10.1007/3-540-48910-X_28
Yevgeniy Dodis, Efficient Construction of (Distributed) Verifiable Random Functions public key cryptography. pp. 1- 17 ,(2003) , 10.1007/3-540-36288-6_1
Oded Goldreich, Rafail Ostrovsky, Software protection and simulation on oblivious RAMs Journal of the ACM. ,vol. 43, pp. 431- 473 ,(1996) , 10.1145/233551.233553
Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan, Private information retrieval Journal of the ACM. ,vol. 45, pp. 965- 981 ,(1998) , 10.1145/293347.293350