Abstract
In this paper, we present a new identity based signcryption scheme with public verifiability using quadratic residue and pairings over elliptic curves, and give a security proof about the original scheme in the random oracle model. Furthermore, this paper focuses on a multisender(t,n) identity based threshold sighcryption. Finally, we prove the scheme of threshold setting is secure as the original scheme.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Y. Zheng, Digital signcryption or how to achieve cost (signature & encryption) << cost (signature) + cost (encryption), In Advances in Cryptology — Crypto’97, LNCS 1294, pp. 165–179, 1997.
Y. Mu and V. Varadharajan. Distributed signcryption. INDOCRYPT’00, LNCS 1977, pp. 155–164. Springer-Verlag, 2000.
D. Kwak and S. Moon. Efficient Distributed Signcryption Scheme as Group Signcryption. In: Applied Cryptography and Network Security (ACNS’03), LNCS 2846, pp. 403–417. Springer-Verlag, 2003.
Ran Canetti, Uri Feige, Oded Goldreich, and Moni Naor. Adaptively secure multiparty computation. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 639–648, Philadelphia, Pennsylvania, 22–24 May 1996.
R. Canetti, R. Gennaro, S. jarecki, H. Krawczyk, and T. Rabin. Adaptive security for threshold cryptosystems. In Advances in Cyptology-CRYPTO 99. Springer-Verlag, 1999.
S. Micali and P. Rogaway, Secure computaion. In Joan Feigenbaum, editor, Advances in Cryptology — Crypto’91, pages 392–404, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576.
D. Beaver, Foundations of secure interactive computing. In Joan Feigenbaum, editor, Advances in Cryptology — Crypto’91, pages 377–391, Berlin, 1991. Springer-Verlag. Lecture Notes in Computer Science Volume 576.
V. Shoup. Practical threshold signatures. IBM Reseearch Report RZ3121 (April 19 1999).
Y. Desmedt, Threshold cryptography, European Transactions on Telecommunications, 5(4), 1994.
Y. Desmedt and Y. Frankel, Threshold cryptosystems, Advances in Cryptology, Crypto’89, LNCS Vol. 435, 1989.
Hyung Koo, Hyun-Jeong Kim, Ik Rae Jeong, Dong-Hoon Lee, and Jongin Lim, Jointly unsigncryptable signcryption, WISA 2001, Vol.2, pp. 397–407, 2001.
F. Hess. Efficient identity based signature schemes based on parings, SAC 2002, LNCS 2595, Springer-Verlag, 2003. 310–324
J. Malone-Lee and W. Mao. Two birds one stone: signcryption using RSA. In Topics in Cryptology — proceedings of CT-RSA 2003, LNCS 2612, pp. 211–225. Springer, 2003.
Libert B, Quisquater J J. New Identity Based Signcryption Based on Parings. Cryptology ePrint Archive, Report 2003/023, http://eprint.iacer.org, February 2003
Boneh D, Franklin M. Identity Based Encryption from the Weir Paring, Advances in Cryptology-Crypto’01, LNCS 2139, Springer-Verlag, 2001. 213–219
Rabin M O. Digitalized Signatures and Public Key Functions as Intractable as Factorization. MIT Laboratory for Computer Science, 1979, MIT/LCS/TR-212.
Baek J, Ron S, Zheng Y. Formal Proofs for the Security Signcryption, PKC 2002, LNCS 2274, Springer-Verlag, 2002. 80–98
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
Chen, W., Lei, F., Guo, F., Chen, G. (2007). Public Verifiable Multi-sender Identity Based Threshold Signcryption. In: EC2ND 2006. Springer, London. https://doi.org/10.1007/978-1-84628-750-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-84628-750-3_4
Publisher Name: Springer, London
Print ISBN: 978-1-84628-749-7
Online ISBN: 978-1-84628-750-3
eBook Packages: Computer ScienceComputer Science (R0)