The mobile people architecture
ACM SIGMOBILE Mobile Computing and Communications Review - Special issue dedicated to Mark Weiser
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
k-Resilient Identity-Based Encryption in the Standard Model
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Tag-KEM/DEM: A New Framework for Hybrid Encryption
Journal of Cryptology
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
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
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
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
Public key encryption with keyword search based on K-resilient IBE
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
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
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
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
Tag-KEM/DEM: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt KEM
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
New online/offline signature schemes without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
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
| Hi-index | 0.00 |
On these days, users tend to access to online content via mobile devices, for example, e-mails. Because these devices have constrained resources, users may wish to instruct e-mail gateways to search through new e-mails and only download those corresponding to particular keywords, such as “urgent.” Yet, this searching should not compromise the user's privacy. A public key encryption with keyword search (PEKS) scheme achieves both these requirements. Most PEKS schemes are constructed on the basis of bilinear pairings. Recently, Khader proposed the first PEKS scheme that does not require bilinear pairings and is provably indistinguishable chosen-keyword attack (IND-CKA) secure in the standard model. Such a scheme is more efficient than pairing-based ones. In this paper, we show a drawback of Khader's scheme in that it depends on an unnecessary security assumption: Its IND-CKA security requires its underlying identity-based encryption building block to be indistinguishable chosen-ciphertext attack secure. We construct a more efficient PEKS scheme that achieves the same level of PEKS security as Khader's but that only requires the underlying identity-based encryption to be indistinguishable chosen-plaintext attack secure. We give a direct proof that the proposed scheme is IND-CKA secure. Our scheme outperforms other recent PEKS schemes in literature. Copyright © 2012 John Wiley & Sons, Ltd.