Searchable symmetric encryption: improved definitions and efficient constructions
暂无分享,去创建一个
Rafail Ostrovsky | Reza Curtmola | Juan A. Garay | Seny Kamara | J. Garay | R. Ostrovsky | R. Curtmola | S. Kamara | Reza Curtmola
[1] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[2] Rafail Ostrovsky,et al. Efficient computation on oblivious RAMs , 1990, STOC '90.
[3] Silvio Micali,et al. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design , 1986, CRYPTO.
[4] L FredmanMichael,et al. Storing a Sparse Table with 0(1) Worst Case Access Time , 1984 .
[5] Manuel Blum,et al. Checking the correctness of memories , 2005, Algorithmica.
[6] Oded Goldreich,et al. Universal arguments and their applications , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[7] Mihir Bellare,et al. Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.
[8] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[9] Vitaly Shmatikov,et al. Obfuscated databases and group privacy , 2005, CCS '05.
[10] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[11] Robert Tappan Morris,et al. Ivy: a read/write peer-to-peer file system , 2002, OSDI '02.
[12] Rafail Ostrovsky,et al. Private Searching on Streaming Data , 2005, Journal of Cryptology.
[13] GoldreichOded,et al. Software protection and simulation on oblivious RAMs , 1996 .
[14] Oded Goldreich,et al. A uniform-complexity treatment of encryption and zero-knowledge , 1993, Journal of Cryptology.
[15] Rafail Ostrovsky,et al. Public Key Encryption That Allows PIR Queries , 2007, CRYPTO.
[16] Rafail Ostrovsky,et al. Round-Optimal Secure Two-Party Computation , 2004, CRYPTO.
[17] Mihir Bellare,et al. Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions , 2005, Journal of Cryptology.
[18] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[19] Bill Cheswick,et al. Privacy-Enhanced Searches Using Encrypted Bloom Filters , 2004, IACR Cryptol. ePrint Arch..
[20] Rafail Ostrovsky,et al. Public Key Encryption with Keyword Search , 2004, EUROCRYPT.
[21] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[22] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[23] Rafail Ostrovsky,et al. Batch codes and their applications , 2004, STOC '04.
[24] Ahmed Obied,et al. Broadcast Encryption , 2008, Encyclopedia of Multimedia.
[25] Lucas Ballard,et al. Achieving Efficient Conjunctive Keyword Searches over Encrypted Data , 2005, ICICS.
[26] Kihyun Kim,et al. Public Key Encryption with Conjunctive Field Keyword Search , 2004, WISA.
[27] Rafail Ostrovsky,et al. Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[28] Brent Waters,et al. Secure Conjunctive Keyword Search over Encrypted Data , 2004, ACNS.
[29] Michael Mitzenmacher,et al. Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.
[30] J. Davenport. Editor , 1960 .
[31] Miguel Castro,et al. Farsite: federated, available, and reliable storage for an incompletely trusted environment , 2002, OPSR.
[32] Mihir Bellare,et al. Efficiently-Searchable and Deterministic Asymmetric Encryption , 2006 .
[33] Pieter H. Hartel,et al. Towards an Information Theoretic Analysis of Searchable Encryption , 2008, ICICS.
[34] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[35] Elaine Shi,et al. Multi-Dimensional Range Query over Encrypted Data , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).
[36] Alexandra Boldyreva,et al. Provably-Secure Schemes for Basic Query Support in Outsourced Databases , 2007, DBSec.
[37] Eu-Jin Goh,et al. Secure Indexes , 2003, IACR Cryptol. ePrint Arch..
[38] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[39] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[40] Brent Waters,et al. Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.
[41] John Black,et al. Ciphers with Arbitrary Finite Domains , 2002, CT-RSA.
[42] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[43] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[44] Rafail Ostrovsky,et al. Cryptography from Anonymity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).