A Secure Public Key Encryption from Computational Linear Diffe-Hellman Problem

Abstract

This paper proposes a practical public key encryption scheme which is provable chosen ciphertext(CCA) secure based on the gap computational linear Diffie-Hellman assumption in the standard model. This is the first CCA secure scheme based on the gap computational linear Diffie-Hellman assumption. This scheme is efficient and the proof of the security is… (More)
DOI: 10.1109/CIS.2012.110

1 Figure or Table

Topics

  • Presentations referencing similar topics