Abstract
The concept of stateful encryption was introduced by Bellare et al. in 2006. Compared with conventional public key encryption scheme, stateful encryption can achieve much better encryption performance. In this paper, we introduce a related primitive called stateful identity based key encapsulation mechanism (SIBKEM). SIBKEM is a simpler primitive, however, together with multi-time use IND-CCA secure symmetric encryption, it implies secure stateful identity based encryption. We then demonstrate there is a generic construction of SIBKEM from a wide class of identity based non-interactive key exchange schemes.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270–299 (1984)
Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC, pp. 427–437. ACM, New York (1990)
Bellare, M., Kohno, T., Shoup, V.: Stateful public-key cryptosystems: how to encrypt with one 160-bit exponentiation. In: ACM CCS 2006, pp. 380–389. ACM, New York (2006)
Baek, J., Zhou, J., Bao, F.: Generic constructions of stateful public key encryption and their applications. In: Bellovin, S.M., et al. (eds.) ACNS 2008. LNCS, vol. 5037, pp. 75–93. Springer, Heidelberg (2008)
Shoup, V.: A standard for public-key encryption. ISO 18033-2 (2006)
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)
Phong, L.T., Matsuoka, H., Ogata, W.: Stateful identity-based encryption scheme: Faster encryption and decryption. In: ASIACCS 2008, pp. 381–388. ACM, New York (2008)
Yang, P., Zhang, R., Matsuura, K.: Stateful public key encryption: How to remove gap assumptions and maintaining tight reductions. In: ISITA 2008. IEEE, Los Alamitos (2008)
Paterson, K.G., Srinivasan, S.: On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. Journal version at DCC [10]
Paterson, K.G., Srinivasan, S.: On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. Designs, Codes and Cryptography 52, 219–241 (2009); Preliminary versions at Cryptology ePrint Archive: Report 2007/453 [9]
Bentahar, K., Farshim, P., Malone-Lee, J., Smart, N.P.: Generic constructions of identity-based and certificateless kems. J. Cryptology 21(2), 178–199 (2008)
Sakai, R., Ohgishi, K., Kasahara, M.: Cryptosystems based on pairing. In: SCIS 2000, pp. 26–28 (2000)
Bellare, M., Namprempre, C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531–545. Springer, Heidelberg (2000); Full version appeared in [14]
Bellare, M., Namprempre, C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. J. Cryptology 21(4), 469–491 (2008); Preliminary version appeared in [13]
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, P., Zhang, R., Matsuura, K., Imai, H. (2009). Generic Construction of Stateful Identity Based Encryption. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds) Information Security. ISC 2009. Lecture Notes in Computer Science, vol 5735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04474-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-04474-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04473-1
Online ISBN: 978-3-642-04474-8
eBook Packages: Computer ScienceComputer Science (R0)