Constructing PEKS schemes secure against keyword guessing attacks is possible?

Authors:
Ik Rae Jeong;Jeong Ok Kwon;Dowon Hong;Dong Hoon Lee
Affiliations:
Graduate School of Information Management & Security, CIST Korea University, 1, 5-Ka, Anam-dong, Sungbuk-ku, Seoul 136-701, Republic of Korea;Graduate School of Information Management & Security, CIST Korea University, 1, 5-Ka, Anam-dong, Sungbuk-ku, Seoul 136-701, Republic of Korea;Electronics and Telecommunications Research Institute, 161 Gajeong-dong, Yuseoung-Gu, Daejeon 305-700, Republic of Korea;Graduate School of Information Management & Security, CIST Korea University, 1, 5-Ka, Anam-dong, Sungbuk-ku, Seoul 136-701, Republic of Korea
Venue:
Computer Communications
Year:
2009

Citing 7
Cited 7

Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Practical Techniques for Searches on Encrypted Data

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Oblivious keyword search

Journal of Complexity - Special issue on coding and cryptography
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

Journal of Cryptology
Deterministic and efficiently searchable encryption

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Public key encryption with conjunctive field keyword search

WISA'04 Proceedings of the 5th international conference on Information Security Applications
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

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
On a security model of conjunctive keyword search over encrypted relational database

Journal of Systems and Software
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
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
Public key encryption with keyword search secure against keyword guessing attacks without random oracle

Information Sciences: an International Journal

Quantified Score

Hi-index	0.25

Visualization

Abstract

Byun et al. suggested keyword guessing attacks and showed that some PEKS (public-key encryption with keyword search) schemes are not secure to keyword guessing attacks, when the number of possible keywords is bounded by some polynomial. Abdalla et al. showed that robust PEKS schemes should satisfy consistency which ensures the PEKS schemes fulfil their functions. In the paper, we show a negative result about the open problem to construct secure PEKS schemes against keyword guessing attacks. Our result shows that consistency implies insecurity to keyword guessing attacks in PEKS. This means that constructing secure and consistent PEKS schemes against keyword guessing attacks is impossible, when the number of possible keywords is bounded by some polynomial.