Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
SIAM Journal on Computing
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
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
Randomness Re-use in Multi-recipient Encryption Schemeas
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
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
Security and Access of Health Research Data
Journal of Medical Systems
Controlled privacy preserving keyword search
Proceedings of the 2008 ACM symposium on Information, computer and communications security
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
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
FC'10 Proceedings of the 14th international conference on Financial cryptograpy and data security
Public-key encryption with registered keyword search
EuroPKI'09 Proceedings of the 6th European conference on Public key infrastructures, services and applications
Public-key encryption with delegated search
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Theoretical Computer Science
Efficient encryption with keyword search in mobile networks
Security and Communication Networks
Information Sciences: an International Journal
Expressive search on encrypted data
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Towards asymmetric searchable encryption with message recovery and flexible search authorization
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Public-key searchable encryption from lattices
International Journal of High Performance Systems Architecture
Hi-index | 0.00 |
In this paper, we consider the problem of combining a public key encryption (PKE) scheme and a public key encryption with keyword search (PEKS) scheme proposed by Boneh, Di Crescenzo, Ostrovsky and Persiano (BDOP) in Eurocrypt 2004. We argue that the two schemes need to be treated as a single scheme to securely provide the PEKS service that BDOP envisioned. We formally define such a scheme, which we call “PKE/PEKS” and its security against chosen ciphertext attack, which we call “IND-PKE/PEKS-CCA”. We then construct a highly efficient PKE/PEKS scheme using the PEKS scheme presented by BDOP and a variation of ElGamal encryption scheme and show that it is IND-PKE/PEKS-CCA secure in the random oracle model assuming that the Computational Diffie-Hellman (CDH) problem is intractable. We also propose a generic construction of PKE/PEKS, which is slightly less efficient than the first one. Finally, we present two extensions of a PKE/PEKS scheme to the multi-receiver setting and multi-keyword setting.