A randomized protocol for signing contracts
Communications of the ACM
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
A cryptographic file system for UNIX
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Provably Secure Blind Signature Schemes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Multi-recipient Public-Key Encryption with Shortened Ciphertext
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Journal of Complexity - Special issue on coding and cryptography
A universal access smart-card-based secure file system
ALS'99 Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3
Public key encryption with conjunctive field keyword search
WISA'04 Proceedings of the 5th international conference on Information Security Applications
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Oblivious conjunctive keyword search
WISA'05 Proceedings of the 6th international conference on Information Security Applications
On a security model of conjunctive keyword search over encrypted relational database
Journal of Systems and Software
Symmetric inner-product predicate encryption based on three groups
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Hi-index | 0.00 |
In a keyword search scheme a user stores encrypted data on an untrusted server and gives a database manager a capability for a keyword which enables a database manager to find encrypted data containing the keyword without revealing the keyword to the database manager. Conjunctive keyword search scheme enables a user to obtain data containing all of several keywords through only one query. One of the security requirements of conjunctive keyword search schemes is that a malicious adversary should not be able to generate new valid capabilities from the observed capabilities. In this paper we show that conjunctive keyword search schemes are not secure. In particular, given two capabilities corresponding two sets of keywords, an adversary is able to generate a new capability corresponding to the difference set of two keywords sets.