Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Password authentication with insecure communication
Communications of the ACM
Public-Key Cryptosystems from Lattice Reduction Problems
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
Privacy preserving error resilient dna searching through oblivious automata
Proceedings of the 14th ACM conference on Computer and communications security
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Deterministic and efficiently searchable encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Dynamic searchable symmetric encryption
Proceedings of the 2012 ACM conference on Computer and communications security
Privacy-preserving noisy keyword search in cloud computing
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Efficient keyword search over encrypted data with fine-grained access control in hybrid cloud
NSS'12 Proceedings of the 6th international conference on Network and System Security
Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Outsourced symmetric private information retrieval
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Privacy-preserving data utilization in hybrid clouds
Future Generation Computer Systems
| Hi-index | 0.00 |
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are performed by the same client. Most conventional searchable encryption schemes suffer from two disadvantages. First, searching the stored documents takes time linear in the size of the database, and/or uses heavy arithmetic operations. Secondly, the existing schemes do not consider adaptive attackers; a search-query will reveal information even about documents stored in the future. If they do consider this, it is at a significant cost to the performance of updates. In this paper we propose a novel symmetric searchable encryption scheme that offers searching at constant time in the number of unique keywords stored on the server. We present two variants of the basic scheme which differ in the efficiency of search and storage. We show how each scheme could be used in a personal health record system.