Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
3-2010
Abstract
We present a (probabilistic) public key encryption (PKE) scheme such that when being implemented in a bilinear group, anyone is able to check whether two ciphertexts are encryptions of the same message. Interestingly, bilinear map operations are not required in key generation, encryption or decryption procedures of the PKE scheme, but is only required when people want to do an equality test (on the encrypted messages) between two ciphertexts that may be generated using different public keys. We show that our PKE scheme can be used in different applications such as searchable encryption and partitioning encrypted data. Moreover, we show that when being implemented in a non-bilinear group, the security of our PKE scheme can be strengthened from One-Way CCA to a weak form of IND-CCA.
Keywords
Public Key Encryption, Adaptive Chosen Ciphertext Attacks, Ciphertext Comparability, Searchable Encryption, Bilinear Map
Discipline
Information Security
Research Areas
Information Systems and Management
Publication
Topics in Cryptology: Cryptographers’ Track at the RSA Conference, CT-RSA 2010, San Francisco, March 1-5: Proceedings
Volume
5985
First Page
119
Last Page
131
ISBN
9783642119248
Identifier
10.1007/978-3-642-11925-5_9
Publisher
Springer
City or Country
Cham
Citation
YANG, Guomin; TAN, Chik How; HUANG, Qiong; and WONG, Duncan S..
Probabilistic public key encryption with equality test. (2010). Topics in Cryptology: Cryptographers’ Track at the RSA Conference, CT-RSA 2010, San Francisco, March 1-5: Proceedings. 5985, 119-131.
Available at: https://ink.library.smu.edu.sg/sis_research/7419
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-642-11925-5_9