Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Rejection-inversion to generate variates from monotone discrete distributions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Keying Hash Functions for Message Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Provably-secure schemes for basic query support in outsourced databases
Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Deterministic and efficiently searchable encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Computationally efficient searchable symmetric encryption
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Delegatable pseudorandom functions and applications
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Outsourced symmetric private information retrieval
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Supporting complex queries and access policies for multi-user encrypted databases
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Efficiency and security in similarity cloud services
Proceedings of the VLDB Endowment
Efficient privacy-aware search over encrypted databases
Proceedings of the 4th ACM conference on Data and application security and privacy
Search pattern leakage in searchable encryption: Attacks and new construction
Information Sciences: an International Journal
Building web applications on top of encrypted data using Mylar
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
Hi-index | 0.00 |
Searchable symmetric encryption (SSE) allows a client to encrypt its data in such a way that this data can still be searched. The most immediate application of SSE is to cloud storage, where it enables a client to securely outsource its data to an untrusted cloud provider without sacrificing the ability to search over it. SSE has been the focus of active research and a multitude of schemes that achieve various levels of security and efficiency have been proposed. Any practical SSE scheme, however, should (at a minimum) satisfy the following properties: sublinear search time, security against adaptive chosen-keyword attacks, compact indexes and the ability to add and delete files efficiently. Unfortunately, none of the previously-known SSE constructions achieve all these properties at the same time. This severely limits the practical value of SSE and decreases its chance of deployment in real-world cloud storage systems. To address this, we propose the first SSE scheme to satisfy all the properties outlined above. Our construction extends the inverted index approach (Curtmola et al., CCS 2006) in several non-trivial ways and introduces new techniques for the design of SSE. In addition, we implement our scheme and conduct a performance evaluation, showing that our approach is highly efficient and ready for deployment.