Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Keying Hash Functions for Message Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Selecting Cryptographic Key Sizes
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Untraceable RFID tags via insubvertible encryption
Proceedings of the 12th ACM conference on Computer and communications security
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Public key encryption with conjunctive field keyword search
WISA'04 Proceedings of the 5th international conference on Information Security Applications
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
Information Security Applications
Multiuser private queries over encrypted databases
International Journal of Applied Cryptography
Common secure index for conjunctive keyword-based retrieval over encrypted data
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
Private query on encrypted data in multi-user settings
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Restricted queries over an encrypted index with applications to regulatory compliance
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
An efficient public key encryption with conjunctive-subset keywords search
Journal of Network and Computer Applications
Anonymity from asymmetry: new constructions for anonymous HIBE
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Public key encryption with conjunctive keyword search and its extension to a multi-user system
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Boolean symmetric searchable encryption
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
Efficient multi-keyword ranked query over encrypted data in cloud computing
Future Generation Computer Systems
Searchable symmetric encryption: Improved definitions and efficient constructions
Journal of Computer Security
| Hi-index | 0.00 |
We present two provably secure and efficient schemes for performing conjunctive keyword searches over symmetrically encrypted data. Our first scheme is based on Shamir Secret Sharing and provides the most efficient search technique in this context to date. Although the size of its trapdoors is linear in the number of documents being searched, we empirically show that this overhead remains reasonable in practice. Nonetheless, to address this limitation we provide an alternative based on bilinear pairings that yields constant size trapdoors. This latter construction is not only asymptotically more efficient than previous secure conjunctive keyword search schemes in the symmetric setting, but incurs significantly less storage overhead. Additionally, unlike most previous work, our constructions are proven secure in the standard model.