Substring-Searchable Symmetric Encryption
暂无分享,去创建一个
[1] Carmit Hazay,et al. Text Search Protocols with Simulation Based Security , 2010, Public Key Cryptography.
[2] Jonathan Katz,et al. Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation , 2000, FSE.
[3] Hugo Krawczyk,et al. Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation , 2014, NDSS.
[4] Craig Gentry,et al. Fully Homomorphic Encryption with Polylog Overhead , 2012, EUROCRYPT.
[5] Richard M. Karp,et al. Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..
[6] Marten van Dijk,et al. Iris: a scalable cloud file system with efficient integrity checks , 2012, ACSAC '12.
[7] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, Journal of Cryptology.
[8] Martín Abadi,et al. Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) , 2007, Journal of Cryptology.
[9] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[10] Marc Fischlin,et al. Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications , 1999, EUROCRYPT.
[11] Martin Farach-Colton,et al. Optimal Suffix Tree Construction with Large Alphabets , 1997, FOCS.
[12] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[13] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[14] Brent Waters,et al. Functional Encryption: Definitions and Challenges , 2011, TCC.
[15] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[16] Yehuda Lindell,et al. Introduction to Modern Cryptography , 2004 .
[17] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[18] Jonathan Katz,et al. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products , 2008, Journal of Cryptology.
[19] Srinivas Devadas,et al. A secure processor architecture for encrypted computation on untrusted programs , 2012, STC '12.
[20] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .
[21] Charalampos Papamanthou,et al. Parallel and Dynamic Searchable Symmetric Encryption , 2013, Financial Cryptography.
[22] GentryCraig,et al. Leveled) Fully Homomorphic Encryption without Bootstrapping , 2014 .
[23] Elaine Shi,et al. Towards Practical Oblivious RAM , 2011, NDSS.
[24] Kaoru Kurosawa,et al. UC-Secure Searchable Symmetric Encryption , 2012, Financial Cryptography.
[25] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[26] Babak Sadeghiyan,et al. An Efficient Protocol for Oblivious DFA Evaluation and Applications , 2012, CT-RSA.
[27] Carmit Hazay,et al. Signature Schemes Secure Against Hard-to-Invert Leakage , 2015, Journal of Cryptology.
[28] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[29] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[30] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[31] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[32] Chanathip Namprempre,et al. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, Journal of Cryptology.
[33] Elaine Shi,et al. Practical Dynamic Searchable Encryption with Small Leakage , 2014, NDSS.
[34] Rafail Ostrovsky,et al. 5PM: Secure pattern matching , 2012, J. Comput. Secur..
[35] Keith B. Frikken. Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation , 2009, DBSec.
[36] Stefan Katzenbeisser,et al. Privacy preserving error resilient dna searching through oblivious automata , 2007, CCS '07.
[37] Jonathan Katz,et al. Secure text processing with applications to private DNA matching , 2010, CCS '10.
[38] Charalampos Papamanthou,et al. Dynamic searchable symmetric encryption , 2012, IACR Cryptol. ePrint Arch..
[39] Moni Naor,et al. How Efficient Can Memory Checking Be? , 2009, TCC.
[40] Craig Gentry,et al. Homomorphic Evaluation of the AES Circuit , 2012, IACR Cryptol. ePrint Arch..
[41] Mihir Bellare,et al. Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography , 2000, ASIACRYPT.
[42] Rafail Ostrovsky,et al. Software protection and simulation on oblivious RAMs , 1996, JACM.
[43] Yael Tauman Kalai,et al. Memory Delegation , 2011, CRYPTO.
[44] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[45] Craig Gentry,et al. (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.
[46] Elaine Shi,et al. Predicate Privacy in Encryption Systems , 2009, IACR Cryptol. ePrint Arch..
[47] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[48] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.
[49] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.