Provable Secure Identity-based Threshold Signcryption Scheme in the Standard Model

doi:10.13190/jbupt.201002.11.sunh

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (2): 11-15.doi: 10.13190/jbupt.201002.11.sunh

• Papers • Previous Articles Next Articles

Provable Secure Identity-based Threshold Signcryption Scheme in the Standard Model

SUN Hua, YAO Xuan-xia, LIU Xing-bing, HAN Xiao-guang

School of Information Engineering, University of Science and Technology, Beijing 100083, China

Received:2009-06-20 Revised:1900-01-01 Online:2010-04-28 Published:2010-04-28

Abstract

Abstract:

An efficient identity-based threshold signcryption scheme was presented. With bilinear pairings technology, a proved secure threshold signcryption scheme was designed in the standard model, based on Waters and Paterson’s signature scheme. We prove its semantic security on the hardness of decisional bilinear Diffie-Hellman problem and its unforgeability on the hardness of computational Diffie-Hellman problem. Compared with other schemes in the random oracle model, this scheme is more meaningful.

Key words: Threshold signcryption, Standard model, Computational Diffie-Hellman problem, Decisional Bilinear Diffie-Hellman problem

References

[1] Shamir A. Identity-based cryptosystems and signature schemes//Proceedings of Crypto 1984. New York: Springer-Verlag, 1985: 47-53.
[2] Boneh D, Franklin M. Identity-based encryption from the Weil pairing//Proceedings of Crypto 2001. Santa Barbara: Springer-Verlag, 2001: 213-229.
[3] Gentry C. Practical identity-based encryption without random oracles//Proceedings of Eurocrypt 2006. St. Petersburg: Springer-Verlag, 2006: 445-464.
[4] Waters B. Efficient identity-based encryption without random oracles//Proceedings of Eurocrypt 2005. Aarhus: Springer-Verlag, 2005: 114-127.
[5] Hess F. Efficient identity based signature schemes based on pairings//Proceedings of SAC 2002. Newfoundland: Springer-Verlag, 2002: 310-324.
[6] Paterson K G, Schuldt J C N. Efficient identity-based signatures secure in the standard model//Proceedings of ACISP 2006. Melbourne: Springer-Verlag, 2006: 207-222.
[7] Zheng Yuliang. Digital signcryption or how to achieve cost(signature & encryption)cost(signature)+cost(encryption)//Advances in Cryptology-Crypto 1997. California: Springer-Verlag, 1997: 165-179.
[8] An J H, Yevgeniy Dodis, Tal Rabin. On the security of joint signature and encryption//Advances in Cryptology-Eurocrypt 2002. Netherlands: Springer-Verlag, 2002: 83-107.
[9] Libert B, Quisquater J J. Efficient signcryption with key privacy from gap diffie-hellman groups//Proceedings of PKC 2004. Singapore: Springer-Verlag, 2004: 187-200.
[10] Malone-Lee J. Identity-based signcryption. 2002. http://eprint. iacr. org/.
[11] Libert B, Quisquater J J. New identity based signcryption schemes from pairings. 2003. http://eprint. iacr. org/.
[12] Duan Shanshan, Cao Zhenfu, Lu Rongxing. Robust id-based threshold signcryption scheme from pairings//Proceedings of 3^rd International Conference on Information Security. Shanghai: ACM, 2004: 33-37.
[13] Peng Changgen, Li Xiang. An identity-based threshold signcryption scheme with semantic security//Proceedings of CIS 2005. Xian: Springer-Verlag, 2005: 173-179.
[14] Li Fagen, Yu Yong. An efficient and provably secure id-based threshold signcryption scheme//Proceedings of ICCCAS 2008. Xiamen: Springer-Verlag, 2008: 488-492.

Provable Secure Identity-based Threshold Signcryption Scheme in the Standard Model

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 3

Recommended Articles

Metrics

Comments

[1]	TANG Yong-li, HU Ming-xing, YE Qing, QIN Pan-ke, YU Jin-xia. Improved Multi-Identity Based Fully Homomorphic Encryption Scheme over Lattices [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2018, 41(1): 125-133.
[2]	Qing Wu. New Strongly Unforgeable IdentityBased Signature  Scheme in the Standard Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(3): 71-74.
[3]	. Provably Secure IdentityBased Signature Scheme in the Standard Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2011, 34(1): 99-102.