Abstract
A new generic construction of a signcryption scheme from randomness recoverable public key encryption (PKE-RR) is proposed. This paper modifies the ‘Li & Wong’ construction [Information Sciences 180 (2010)] to achieve better security from weaker building blocks and thereby making it open to a larger class of encryption and signature schemes. The proposed construction achieves multi-user insider security for confidentiality in random oracle model and authenticity in standard model. It is done by incorporating one extra hashing in both signcryption and unsigncryption phases than the original construction.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
An, J.H., Dodis, Y., Rabin, T.: On the security of joint signature and encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 83–107. Springer, Heidelberg (2002)
Baek, J., Steinfeld, R., Zheng, Y.: Formal proofs for the security of signcryption. Journal of Cryptology 20(2), 203–235 (2007)
Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92–111. Springer, Heidelberg (1995)
Dachman-Soled, D., Fuchsbauer, G., Mohassel, P., O’Neill, A.: Enhanced Chosen-Ciphertext Security and Applications. Eprint archive (2012), http://eprint.iacr.org/2012/543
Das, A., Adhikari, A.: An Efficient IND-CCA2 secure Paillier-based cryptosystem. Information Processing Letters 112, 885–888 (2012)
Elgamal, T.: A Public Key Cryptosystem And A Signature Scheme Based On Discrete Logarithms. IEEE Trans. on Information Theory, IT-31(4), 469–472 (1985)
Fujisaki, E., Okamoto, T.: How to Enhance the Security of Public-Key Encryption at Minimum Cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 53–68. Springer, Heidelberg (1999)
Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: A ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267–288. Springer, Heidelberg (1998)
Li, C.K., Wong, D.S.: Signcryption from randomness recoverable public key encryption. Information Sciences 180, 549–559 (2010)
Matsuda, T., Matsuura, K., Schuldt, J.C.N.: Efficient Constructions of Signcryption Schemes and Signcryption Composability. In: Roy, B., Sendrier, N. (eds.) INDOCRYPT 2009. LNCS, vol. 5922, pp. 321–342. Springer, Heidelberg (2009)
McEliece, R.: A public key cryptosystem based on algebraic coding theory. DSN Progress Report 42-44, 114–116 (1978)
Nieto, J.M.G., Boyd, C., Dawson, E.: A Public Key Cryptosystem Based On A Subgroup Membership Problem. Designs, Codes and Cryptography 36, 301–316 (2005)
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Rackoff, C., Simon, D.: Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 427–437 (1990)
Zheng, Y.: Digital signcryption or how to achieve cost (signature & encryption) < < cost(signature) + cost(encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A., Adhikari, A. (2013). Signcryption from Randomness Recoverable PKE Revisited. In: Bagchi, A., Ray, I. (eds) Information Systems Security. ICISS 2013. Lecture Notes in Computer Science, vol 8303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45204-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-45204-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45203-1
Online ISBN: 978-3-642-45204-8
eBook Packages: Computer ScienceComputer Science (R0)