An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem

作者：Meshram Chandrashekhar^*

来源：Information Processing Letters, 2015, 115(2): 351-358.

DOI：10.1016/j.ipl.2014.10.007

• Cryptography
• Identity-based encryption
• Integer factorization problem
• Discrete logarithm problem
• Random oracle

ID-based encryption (identity-based) is a very useful tool in cryptography. It has many potential applications. The security of traditional ID-based encryption scheme wholly depends on the security of secret keys. Exposure of secret keys requires reissuing all previously assigned encryptions. This limitation becomes more obvious today as key exposure is more common with increasing use of mobile and unprotected devices. Under this background, mitigating the damage of key exposure in ID-based encryption is an important problem. To deal with this problem, we propose to integrate forward security into ID-based encryption. In this paper, we propose a new construction of ID-based encryption scheme based on integer factorization problem and discrete logarithm problem is semantically secure against chosen plaintext attack (CPA) in random oracle model. We demonstrate that our scheme outperforms the other existing schemes in terms of security, computational cost and the length of public key.

• 出版日期2015-2