2017•Unpublished venueRequires access

A CCA2-Secure Incomparable Public Key Encryption Scheme

Bahman Rajabi, Ziba Eslami

Open publisher page 0 citations

Abstract

In 2003, Waters, Felten and Sahai introduced a novel cryptographic primitive called Incomparable Public Key cryptosystem to protect anonymity of message receivers in an untrusted network. In this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. Recently, Lee and Lim improved the solution of Waters et al. with a more efficient decryption process. Both of these schemes are based on the ELGamal encryption scheme and are CCA1-secure in the sense of data privacy and IK-CPA-secure in the sense of key privacy. In this paper, we employ the Cramer-Shoup encryption scheme to propose the first example of an incomparable public key encryption scheme which is CCA2-secure in data privacy and IK-CCA-secure in key privacy. Therefore, our scheme outperforms existing incomparable public key schemes in security properties.

About this research paper

What this paper is about

In 2003, Waters, Felten and Sahai introduced a novel cryptographic primitive called Incomparable Public Key cryptosystem to protect anonymity of message receivers in an untrusted network. In this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. Recently, Lee and Lim improved the solution of Waters et al. with a more efficient decryption process. Both of these schemes are based on the ELGamal encryption scheme and are CCA1-secure in the sense of data privacy and IK-CPA-secure in the sense of key privacy. In this paper, we employ the Cramer-Shoup encryption scheme to propose the first example of an incomparable public key encryption scheme which is CCA2-secure in data privacy and IK-CCA-secure in key privacy. Therefore, our scheme outperforms existing incomparable public key schemes in security properties.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In 2003, Waters, Felten and Sahai introduced a novel cryptographic primitive called Incomparable Public Key cryptosystem to protect anonymity of message receivers in an untrusted network. In this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. Recently, Lee and Lim improved the solution of Waters et al. with a more efficient decryption process. Both of these schemes are based on the ELGamal encryption scheme and are CCA1-secure in the sense of data privacy and IK-CPA-secure in the sense of key privacy. In this paper, we employ the Cramer-Shoup encryption scheme to propose the first example of an incomparable public key encryption scheme which is CCA2-secure in data privacy and IK-CCA-secure in key privacy. Therefore, our scheme outperforms existing incomparable public key schemes in security properties.

Key concepts: ElGamal encryption, Encryption, Anonymity, Public-key cryptography, Computer security, Computer science, Attribute-based encryption, Cryptography

Related papers

Back to paper searchBrowse research topicsOriginal source
A CCA2-Secure Incomparable Public Key Encryption Scheme — Research Paper | ScholarLens