Skip to main content
placeholder image

Probabilistic Public Key Encryption with Equality Test

Chapter


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.

Authors


  •   Yang, Guomin
  •   Tan, Chik How. (external author)
  •   Huang, Qiong (external author)
  •   Wong, Duncan S. (external author)

Publication Date


  • 2010

Citation


  • Yang, G., Tan, C. How., Huang, Q. & Wong, D. S. (2010). Probabilistic Public Key Encryption with Equality Test. Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings (pp. 119-131). Germany: Springer Berlin Heidelberg.

Scopus Eid


  • 2-s2.0-77952046408

Book Title


  • Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings

Has Global Citation Frequency


Start Page


  • 119

End Page


  • 131

Place Of Publication


  • Germany

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.

Authors


  •   Yang, Guomin
  •   Tan, Chik How. (external author)
  •   Huang, Qiong (external author)
  •   Wong, Duncan S. (external author)

Publication Date


  • 2010

Citation


  • Yang, G., Tan, C. How., Huang, Q. & Wong, D. S. (2010). Probabilistic Public Key Encryption with Equality Test. Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings (pp. 119-131). Germany: Springer Berlin Heidelberg.

Scopus Eid


  • 2-s2.0-77952046408

Book Title


  • Topics in Cryptology - CT-RSA 2010: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings

Has Global Citation Frequency


Start Page


  • 119

End Page


  • 131

Place Of Publication


  • Germany