Probabilistic public key encryption with equality test

Probabilistic public key encryption with equality test

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

Full description

Saved in:
Bibliographic Details
Main Authors: YANG, Guomin, TAN, Chik How, HUANG, Qiong, WONG, Duncan S.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2010
Subjects:
Public Key Encryption
Adaptive Chosen Ciphertext Attacks
Ciphertext Comparability
Searchable Encryption
Bilinear Map
Information Security
Online Access:https://ink.library.smu.edu.sg/sis_research/7419
https://ink.library.smu.edu.sg/context/sis_research/article/8422/viewcontent/Probabilistic_public_key_encryption_with_equality_test.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.

Similar Items