Email this article A Practical Forward-Secure Public-Key Encryption Scheme
Abstract
In open network, cryptographic operations are often performed on insecure, unprotected, and easily-stolen devices, therefore the threat of secret key exposure becomes more and more acute. The paradigm of forward security provides a promising approach to deal with the secret key exposure. This new paradigm guarantees that the compromise of current secret keys does not compromise past secret keys and past communications. Therefore, forward-security can minimize the resulting damage caused by the secret key exposure. In this paper, we present a practical forward-secure public-key encryption (FS-PKE) scheme and prove it to be forward-secure against selective-time period and adaptive chosen plaintext attacks in the standard model. The main performance parameters of our proposed scheme are independent on the total number of time periods in the scheme. When compared with the existing FS-PKE scheme, our proposed scheme is much more efficient and practical. We also discuss how our scheme achieves chosen ciphertext security in the standard model and in the random oracle model respectively.
Keywords
References
R. Anderson, “Two remarks on public key cryptology,” Invited Lecture of ACM CCS’97. Available at http://www.cl.cam.ac.uk/ftp/users/rja14/forwardsecure.pdf.
C.G. G¨unther, “An identity-based key-exchange protocol,” In Advances in Cryptology - EUROCRYPT’89, Belgium, LNCS 434, pp.29-37, 1990.
W. Diffie, P. C. Van-Oorschot, and M. J. Weiner, “Authentication and authenticated key exchanges,” Des.,Codes, Cryptography, 2(2), pp. 107-125, 1992.
http://dx.doi.org/10.1007/BF00124891
M. Bellare and S. Miner, “A forward-secure digital signature scheme,” In Advances in Cryptology - CRYPTO'99, USA, LNCS 1666, pp. 431-448, 1999.
M. Bellare and B. Yee, “Forward security in private-key cryptography,” In RSA Cryptographers’ Track - CT-RSA 2003, USA, LNCS 2612, pp. 1-18, 2003.
R. Canetti, S. Halevi, and J. Katz, “A forward-secure public-key encryption scheme,” In Advances in Cryptology - EUROCRYPT 2003, Ploand, LNCS 2656, pp. 255-271, 2003.
Y. Dodis, J. Katz, S. Xu, and M. Yung, “Key-insulated public-key cryptosystems,” In Advances in Cryptology - EUROCRYPT 2002, Netherlands, LNCS 2332, pp. 65-82, 2002.
Y. Dodis, J. Katz, S. Xu, and M. Yung, “Strong key-insulated signature schemes,” In Public-Key Cryptography - PKC 2003, USA, LNCS 2567, pp. 130-144, 2003.
Y. Dodis, M. Franklin, and J. Katz, “Intrusion-resilient public-key encryption,” In the Cryptographers’ Track at the RSA Conference 2003 (CT-RSA’03), USA, LNCS 2612, pp. 19-32, 2003.
C. Gentry and A. Silverberg, “Hierarchical ID-based cryptography,” In Advances in Cryptology- ASIACRYPT 2002, New Zealand, LNCS 2501, pp. 548-566, 2002.
D. Boneh, X. Boyen, and E. J. Goh, “Hierarchical identity based encryption with constant size ciphertext,” In Advances in Cryptology-EUROCRYPT 2005, Denmark, LNCS 3493, pp. 440-456, 2005.
E. Fujisaki and T. Okamoto, “How to enhance the security of public-key encryption at minimum cost,” In Public Key Cryptography - PKC’99, Japan, LNCS 1560, pp. 53-68, 1999.
E. Fujisaki and T. Okamoto, “Secure integration of asymmetric and symmetric encryption schemes,” In Advances in Cryptology - CRYPTO’99, USA, LNCS 1666, pp. 537-554, 1999.
Y. Lindell, “A simpler construction of CCA2 secure public key encryption under general assumptions,” Journal of Cryptology, 19(3), 2006, pp. 359-377.
http://dx.doi.org/10.1007/s00145-005-0345-x
A. Sahai, “Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security,” In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 1999), USA, pp. 543-553, 1999.
M. Naor and M. Yung, “Public key cryptosystems provably secure against chosen ciphertext attacks,” In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC 1990), USA, pp. 427-437, 1990.
Full Text: PDF