随机预言模型下可证安全的门限FFS签名方案

doi:10.3969/j.issn.1001-2400.2011.06.021

Abstract

Abstract:

A rigorous security proof of a provably adaptively-secure optimal-resilience threshold Feige-Fiat-Shamir signature scheme based on strong RSA assumption is given. In the case of the random oracle model, if the basic Feige-Fiat-Shamir signature scheme is unforgeable against the adaptive chosen message attack, and computing the discrete logarithm modulo a safe prime is hard, the new scheme can be proved to be unforgeable, robust and secure against adaptive adversary.

Key words: threshold cryptography, digital signature, veriable secret sharing,provably secure, adaptive security

XIAO Hong;WANG Hong;MA Runnian;CUI Jie. Provably secure threshold FFS signature scheme in the random oracle model[J].J4, 2011, 38(6): 130-133+151.

References

［1］ Desmedt Y. Society and Group Oriented Cryptography: a New Concept［C］//Proceedings of Advances in Cryptology-CRYPT'87. Berlin: Springer-Verlag Heidelberg, 1987: 120-127.
［2］ Desmedt Y. Threshold Cryptography［J］. European Trans on Telecommunications, 1994, 5(4): 449-457.
［3］ Feige U, Fiat A, Shamir A. Zero-knowledge Proofs of Identity［J］. Journal of Cryptology, 1988, 1(2): 77-94.
［4］ Abdalla M, Miner S, Namprempre C. Forward Security in Threshold Signature Schemes［C］//Proceedings of Topics in Cryptology-CT-RSA 2001. Berlin: Springer-Verlag Heidelberg, 2001: 143-158.
［5］ Wang H, Xiao H, Wei S M, et al. An Efficient Adaptively Secure Threshold Feige-Fiat-Shamir Signature Scheme［C］//2010 Second International Conference on Wireless Networks and Information Systems (WNIS 2010). Chongqing: WNIS, 2010: 171-174.
［6］ Canetti R, Gennaro R, Jarecki S, et al. Adaptive Security for Threshold Cryptosystems［C］//Proceedings of Advances in Cryptology-CRYPT'99［C］. Berlin: Springer-Verlag, 1999: 98-115.
［7］ Chu C K, Liu L S, Tzeng W G. A Threshold GQ Signature Scheme［C］//Proceedings of Applied Cryptography and Network Security Conference—ACNS 2003. Berlin: Springer-Verlag Heidelberg, 2003: 137-150.
［8］ Goldreich O. A Note on Computational Indistinguishability［J］. Information Processing Letters, 1990, 34(5): 227-281.
［9］ Gennaro R, Halevi S, Rabin T. Secure Hash-and-sign Signatures without the Random Oracle［C］//Proceedings of Advances in Cryptology—EUROCRYPT'99. Berlin: Springer-Verlag Heidelberg, 1999: 123-139.
［10］ Cramer R, Shoup V. Signature Schemes Based on the Strong RSA Assumption［J］. ACM Trans on Information and System Security, 2000, 3(3): 161-185.
［11］ Frankel Y, MacKenzie P D, Yung M. Adaptively Secure Distributed Public-key Systems［J］. Theoretical Computer Science, 2002, 287(2): 535-561.
［12］ Pointcheval D, Stern J. Security Arguments for Digital Signatures and Blind Signatures［J］. Journal of Cryptology, 2000, 13(3): 361-396.
［13］ Bellare M, Rogaway P. Random Oracles are Practical: a Paradigm for Designing Efficient Protocols［C］//Proceedings of the First Annual ACM Conferenceon Computer and Communications Security. New York: ACM Press, 1993: 62-73.
［14］ Wang H, Feng D G. Robust Threshold FFS Signature Scheme［C］//Proceedings of the 8th Joint International Computer Conference—JICC 2002. Hangzhou: Zhejiang University Press, 2002: 382-384.

[1]	ZHANG Yongqiang;LIU Jia'nan;TIAN Haibo. [J]. Journal of Xidian University, 2018, 45(1): 117-122.
[2]	WANG Mingwei;HU Yupu. Forward and backward secure signature scheme [J]. J4, 2014, 41(2): 71-78.
[3]	JIANG Mingming;HU Yupu;WANG Baocang;LIU Zhenhua;LAI Qiqi. Proxy re-signature scheme over the lattice [J]. J4, 2014, 41(2): 20-24.
[4]	LIU Dongsu;MIAO Meixia;MA Hua;LIN Ruibin;TIAN Haibo. Digital anti-counterfeiting scheme based on key-exposure free chameleon signature [J]. J4, 2012, 39(5): 24-29.
[5]	WANG Fenghe;HU Yupu;JIA Yanyan. Lattice-based signature scheme in the standard model [J]. J4, 2012, 39(4): 57-61+119.
[6]	ZHANG Yinghui；LI Hui；MA Hua. Free protocol for the subliminal channels in the Schnorr-type ordinal multi-signature schemes [J]. J4, 2011, 38(3): 140-144.
[7]	DING Yong. Key management scheme for WSN using ECC [J]. J4, 2008, 35(4): 739-742.
[8]	JIA Xiao-yun1;3;LUO Shou-shan2;3;YUAN Chao-wei1. New digital signature scheme based on the discrete logarithm [J]. J4, 2008, 35(2): 351-355.
[9]	LI Yong-jiang1;2;LI Wei3;ZHU Xiao-yan1;GE Jian-hua1. New signature scheme based on the strong RSA assumption [J]. J4, 2007, 34(4): 634-637.
[10]	SI Guang-dong1;LI Yan-ping1;2;XIAO Guo-zhen1. An improvement on group signature [J]. J4, 2007, 34(1): 106-109.
[11]	XIN Xiang-jun1;2;LI Fa-gen3;XIAO Guo-zhen1. A fair exchange protocol based on short signature with the off-line semi-trusted third party [J]. J4, 2007, 34(1): 92-95.
[12]	FU Xiao-tong;ZHANG Ning;XIAO Guo-zhen. Security analysis of Chang et al.'s signature scheme with message recovery [J]. J4, 2005, 32(6): 920-921.
[13]	FU Xiao-tong;LU Ming-xin;XIAO Guo-zhen. Forgery attack on a proxy-blind signature scheme [J]. J4, 2005, 32(5): 777-780.
[14]	HUANG Zhen-jie1;2;HAO Yan-hua1;WANG Yu-min1. Convertible designated confirmer partially blind signatures [J]. J4, 2004, 31(5): 757-760.
[15]	LI Yan-ping;ZHANG Jian-zhong. A fair multi-party exchange protocol with the off-line trusted third party [J]. J4, 2004, 31(5): 811-814.

Provably secure threshold FFS signature scheme in the random oracle model

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 10