Efficient Public Key Encryption with Keyword Search Schemes from Pairings

Authors:
Chunxiang Gu;Yuefei Zhu;Heng Pan
Affiliations:
Network Engineering Department, Zhengzhou Information Science and, Technology Institute, Zhengzhou, P.R. China 450002;Network Engineering Department, Zhengzhou Information Science and, Technology Institute, Zhengzhou, P.R. China 450002;school of computer science, Zhongyuan university of technology,
Venue:
Information Security and Cryptology
Year:
2007

Citing 5
Cited 4

Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance

ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions

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

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
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
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.00

Visualization

Abstract

Public key encryption with keyword search (PEKS) scheme to enable one to search encrypted keywords without compromising the security of the original data. In this paper, we propose a new PEKS scheme based on bilinear pairings. The scheme is computationally consistent. There is no pairing operation involved in the encryption procedure and so our new PEKS scheme is more efficient than the scheme of Boneh et.al.in [1]. Then, we provide further discussions on removing secure channel from PEKS, and present an efficient secure channel free PEKSscheme. Our two new schemes can be proved secure in the random oracle model, under the appropriate computational assumptions.