Public Key Encryption with Keyword Search Revisited

Authors:
Joonsang Baek;Reihaneh Safavi-Naini;Willy Susilo
Affiliations:
Cryptography and Security Department, Institute for Infocomm Research (I2R), Singapore;Centre for Information Security and Cryptography, University of Calgary, Canada;Centre for Computer and Information Security Research (CCISR) School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia NSW 2522
Venue:
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
Year:
2008

Citing 4
Cited 24

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Aggregate and verifiably encrypted signatures from bilinear maps

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Anonymous Conditional Proxy Re-encryption without Random Oracle

ProvSec '09 Proceedings of the 3rd International Conference on Provable 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
An efficient public key encryption with conjunctive-subset keywords search

Journal of Network and Computer Applications
Cryptographic cloud storage

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
Hidden credential retrieval without random oracles

WISA'10 Proceedings of the 11th international conference on Information security applications
On a security model of conjunctive keyword search over encrypted relational database

Journal of Systems and Software
Lightweight delegated subset test with privacy protection

ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Public-key encryption with delegated search

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Adaptive secure-channel free public-key encryption with keyword search implies timed release encryption

ISC'11 Proceedings of the 14th international conference on Information security
Designing a secure storage repository for sharing scientific datasets using public clouds

Proceedings of the second international workshop on Data intensive computing in the clouds
Hierarchical conditional proxy re-encryption

Computer Standards & Interfaces
Generic construction of designated tester public-key encryption with keyword search

Information Sciences: an International Journal
Using personal portfolios to manage customer data

DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Conjunctive keywords searchable encryption with efficient pairing, constant ciphertext and short trapdoor

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
Secure and efficient data retrieval over encrypted data using attribute-based encryption in cloud storage

Computers and Electrical Engineering
Stronger security model for public-key encryption with equality test

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Information Sciences: an International Journal
Expressive search on encrypted data

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Supporting complex queries and access policies for multi-user encrypted databases

Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Privacy Preserving Index for Encrypted Electronic Medical Records

Journal of Medical Systems
Anonymous broadcast encryption with an untrusted gateway

International Journal of Security and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The public key encryption with keyword search (PEKS) scheme, proposed by Boneh, Di Crescenzo, Ostrovsky and Persiano, enables one to search for encrypted keywords without compromising the security of the original data. In this paper, we address two important issues of a PEKS scheme, "removing secure channel" and "refreshing keywords", which have not been considered in Boneh et al.'s paper. We point out the inefficiency of the original PEKS scheme due to the use of the secure channel. We resolve this problem by constructing an efficient PEKS scheme that removes a secure channel. We then argue that care must be taken when keywords are used frequently in the PEKS scheme as this situation might contradict the security of PEKS.