The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A block cipher based pseudo random number generator secure against side-channel key recovery
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Efficient And Secure Pseudo-Random Number Generation
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Efficient Public Key Encryption with Keyword Search Schemes from Pairings
Information Security and Cryptology
Off-Line Keyword Guessing Attacks on Recent Public Key Encryption with Keyword Search Schemes
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Public Key Encryption with Keyword Search Revisited
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Universally Composable Adaptive Oblivious Transfer
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Constructing PEKS schemes secure against keyword guessing attacks is possible?
Computer Communications
Improved searchable public key encryption with designated tester
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Theoretical Computer Science
A Secure Channel Free Public Key Encryption with Keyword Search Scheme without Random Oracle
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Trapdoor security in a searchable public-key encryption scheme with a designated tester
Journal of Systems and Software
How intractable is the discrete logarithm for a general finite group?
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Proxy re-encryption with keyword search
Information Sciences: an International Journal
Generic combination of public key encryption with keyword search and public key encryption
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Decryptable searchable encryption
ProvSec'07 Proceedings of the 1st international conference on Provable security
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
An efficient public key encryption with conjunctive-subset keywords search
Journal of Network and Computer Applications
On the integration of public key data encryption and public key encryption with keyword search
ISC'06 Proceedings of the 9th international conference on Information Security
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
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Off-line keyword guessing attacks on recent keyword search schemes over encrypted data
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Generic construction of designated tester public-key encryption with keyword search
Information Sciences: an International Journal
Search pattern leakage in searchable encryption: Attacks and new construction
Information Sciences: an International Journal
Hi-index | 0.07 |
The notion of public key encryption with keyword search (PEKS) was put forth by Boneh et al. to enable a server to search from a collection of encrypted emails given a ''trapdoor'' (i.e., an encrypted keyword) provided by the receiver. The nice property in this scheme allows the server to search for a keyword, given the trapdoor. Hence, the verifier can merely use an untrusted server, which makes this notion very practical. Following Boneh et al.'s work, there have been subsequent works that have been proposed to enhance this notion. Two important notions include the so-called keyword guessing attack and secure channel free, proposed by Byun et al. and Baek et al., respectively. The former realizes the fact that in practice, the space of the keywords used is very limited, while the latter considers the removal of secure channel between the receiver and the server to make PEKS practical. Unfortunately, the existing construction of PEKS secure against keyword guessing attack is only secure under the random oracle model, which does not reflect its security in the real world. Furthermore, there is no complete definition that captures secure channel free PEKS schemes that are secure against chosen keyword attack, chosen ciphertext attack, and against keyword guessing attacks, even though these notions seem to be the most practical application of PEKS primitives. In this paper, we make the following contributions. First, we define the strongest model of PEKS which is secure channel free and secure against chosen keyword attack, chosen ciphertext attack, and keyword guessing attack. In particular, we present two important security notions namely IND-SCF-CKCA and IND-KGA. The former is to capture an inside adversary, while the latter is to capture an outside adversary. Intuitively, it should be clear that IND-SCF-CKCA captures a more stringent attack compared to IND-KGA. Second, we present a secure channel free PEKS scheme secure without random oracle under the well known assumptions, namely DLP, DBDH, SXDH and truncated q-ABDHE assumption. Our contributions fill the gap in the literature and hence, making the notion of PEKS very practical. We shall highlight that our scheme is IND-SCF-CKCA secure.