Please use this identifier to cite or link to this item:
|Title:||Probabilistic public key encryption with equality test|
|Authors:||Yang, G. |
|Keywords:||Adaptive chosen ciphertext attacks|
Public key encryption
|Citation:||Yang, G.,Tan, C.H.,Huang, Q.,Wong, D.S. (2010). Probabilistic public key encryption with equality test. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5985 LNCS : 119-131. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-11925-5_9|
|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. © 2010 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 19, 2019
checked on Jan 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.