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

doi:10.3969/j.issn.1001-2400.2011.06.021

J4 ›› 2011, Vol. 38 ›› Issue (6): 130-133+151.doi: 10.3969/j.issn.1001-2400.2011.06.021

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

肖鸿^1,2;王宏³;马润年¹;崔捷¹

(1. 空军工程大学电讯工程学院，陕西西安 710077；
2. 西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071;
3. 淮北师范大学计算机学院，安徽淮北 235000)

收稿日期:2011-01-22 出版日期:2011-12-20 发布日期:2011-11-29
通讯作者: 肖鸿
作者简介:肖鸿(1967-)，男，讲师，西安电子科技大学博士研究生，E-mail: siaohong@126.com
基金资助:
先进计划与智能计算省部共建教育部重点实验室开放课题资助项目(ADIC2020002);国家自然科学基金资助项目(60773121)

Provably secure threshold FFS signature scheme in the random oracle model

XIAO Hong^1,2;WANG Hong³;MA Runnian¹;CUI Jie¹

(1. Inst. of Telecommunication Eng., Air Force Eng. Univ., Xi'an 710077， China;
2. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071， China;
3. Dept. of Computer Sci. and Tech., Huaibei Normal Univ., Huaibei 235000， China)

Received:2011-01-22 Online:2011-12-20 Published:2011-11-29
Contact: XIAO Hong

摘要/Abstract

摘要：

给出了一种随机预言模型下可证适应性安全的门限FFS签名方案的严格安全性证明．在随机预言模型下，若基础的FFS签名方案在选择消息适应性攻击下是不可伪造的，且假设计算模大安全素数的离散对数问题是困难的，证明了该方案是不可伪造的、鲁棒的和适应性安全的．

关键词: 门限密码学, 数字签名, 可验证秘密共享, 可证明安全, 适应性安全

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

肖鸿;王宏;马润年;崔捷. 随机预言模型下可证安全的门限FFS签名方案[J]. J4, 2011, 38(6): 130-133+151.

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.

参考文献

［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]	张永强;刘佳南;田海博. 满足便携文档格式的公平多方合同签署协议[J]. 西安电子科技大学学报, 2018, 45(1): 117-122.
[2]	王明伟;胡予濮. 一种前向-后向安全的数字签名方案[J]. J4, 2014, 41(2): 71-78.
[3]	江明明;胡予濮;王保仓;刘振华;来齐齐. 格上的代理重签名方案[J]. J4, 2014, 41(2): 20-24.
[4]	刘东苏;苗美霞;马华;林锐斌;田海博. 基于无密钥泄露变色龙签名的数码防伪方案[J]. J4, 2012, 39(5): 24-29.
[5]	孙瑾;胡予濮. 完全安全的基于属性的广播加密方案[J]. J4, 2012, 39(4): 23-28+154.
[6]	王凤和;胡予濮;贾艳艳. 标准模型下的格基数字签名方案[J]. J4, 2012, 39(4): 57-61+119.
[7]	张应辉；李晖；马华. Schnorr类有序多重签名中的阈下信道的封闭协议[J]. J4, 2011, 38(3): 140-144.
[8]	段新东;马建峰. 多域环境下的网络存储系统[J]. J4, 2010, 37(6): 1103-1106+1118.
[9]	朱辉;李晖;王育民. 一种Canetti-Krawczyk模型下的快速认证协议 [J]. J4, 2009, 36(1): 156-161.
[10]	毛立强1;马建峰1;2. 可证明安全的MANET按需距离矢量路由协议分析 [J]. J4, 2008, 35(6): 1063-1068.
[11]	丁勇. 一种用椭圆曲线密码构建的传感网络密钥管理方案[J]. J4, 2008, 35(4): 739-742.
[12]	贾晓芸1;3;罗守山2;3;袁超伟1. 一种新的基于离散对数的签名方案 [J]. J4, 2008, 35(2): 351-355.
[13]	张乐友1;2;胡予濮2;刘振华1;2. 标准模型下基于身份的可证安全门限签名方案 [J]. J4, 2008, 35(1): 81-86.
[14]	杨超;曹春杰;马建峰. 通用可组合安全的Mesh网络认证协议 [J]. J4, 2007, 34(5): 814-817.
[15]	李用江1;2;李蔚3;朱晓妍1;葛建华1. 一个新的强RSA假设下的数字签名方案 [J]. J4, 2007, 34(4): 634-637.

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

Provably secure threshold FFS signature scheme in the random oracle model

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10