Public Key Encryption Scheme with KDM Security Based on Elliptic Curves
Kunpeng Wang · Jisuanji gongcheng · 2012
Most public key encryption schemes are unsecure,if a polynomial time adversary can get ciphertexts that are dependent on the secret key.In order to defend the attacks,this paper gives an instance of the general subgroup indistinguishability assumption——elliptic curve subgroup indistinguishability assumption and a reduction algorithm.It is the first to construct a public key scheme based on elliptic curves over ring Z N2and reduce the indistinguishability of the ciphertexts to elliptic curve subgroup indistinguishability assumption.The scheme is proved secure under the assumption.