Oblivious Substring Search with Updates
暂无分享,去创建一个
[1] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[2] Florian Kerschbaum,et al. Searchable Encryption with Secure and Efficient Updates , 2014, CCS.
[3] Elaine Shi,et al. Path ORAM: an extremely simple oblivious RAM protocol , 2012, CCS.
[4] Srinivas Devadas,et al. RAW Path ORAM: A Low-Latency, Low-Area Hardware ORAM Controller with Integrity Verification , 2014, IACR Cryptol. ePrint Arch..
[5] Srinivas Devadas,et al. Onion ORAM: A Constant Bandwidth and Constant Client Storage ORAM (without FHE or SWHE) , 2015, IACR Cryptology ePrint Archive.
[6] Hugo Krawczyk,et al. Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation , 2014, NDSS.
[7] Eugene W. Myers,et al. Suffix arrays: a new method for on-line string searches , 1993, SODA '90.
[8] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[9] Rafail Ostrovsky,et al. Private information storage (extended abstract) , 1997, STOC '97.
[10] Allison Bishop,et al. Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption , 2010, EUROCRYPT.
[11] Cong Wang,et al. Efficient verifiable fuzzy keyword search over encrypted data in cloud computing , 2013, Comput. Sci. Inf. Syst..
[12] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.
[13] Nathan Chenette,et al. Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions , 2011, CRYPTO.
[14] Nathan Chenette,et al. Efficient Fuzzy Search on Encrypted Data , 2014, FSE.
[15] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[16] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[17] Rafail Ostrovsky,et al. Efficient computation on oblivious RAMs , 1990, STOC '90.
[18] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.
[19] 笠間 慎太郎,et al. Google Books Ngram Viewerの歯科領域への応用 : 検索用語から時代の変遷を読む , 2016 .
[20] Melissa Chase,et al. Pattern Matching Encryption , 2014, IACR Cryptol. ePrint Arch..
[21] Jonathan Katz,et al. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products , 2008, Journal of Cryptology.
[22] Elaine Shi,et al. Oblivious RAM with O((logN)3) Worst-Case Cost , 2011, ASIACRYPT.
[23] Kartik Nayak,et al. Oblivious Data Structures , 2014, IACR Cryptol. ePrint Arch..
[24] Craig Gentry,et al. Optimizing ORAM and Using It Efficiently for Secure Computation , 2013, Privacy Enhancing Technologies.
[25] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[26] Dawn Xiaodong Song,et al. Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.