公平的多方并发签名方案

doi:10.3969/j.issn.1000-436x.2014.03.016

通信学报 ›› 2014, Vol. 35 ›› Issue (3): 140-149.doi: 10.3969/j.issn.1000-436x.2014.03.016

公平的多方并发签名方案

叶青^1,²,杨赟³,郑世慧²,常利伟²,肖达²,杨义先⁴

¹ 河南理工大学计算机科学与技术学院，河南焦作454000
² 北京邮电大学信息安全中心，北京100876
³ 铁道部信息技术中心，北京 100010
⁴ 北京邮电大学灾备技术国家工程实验室，北京100876

出版日期:2014-03-25 发布日期:2017-08-17
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;中央高校基本科研业务费专项基金资助项目;中央高校基本科研业务费专项基金资助项目

Fair multi-party concurrent signature scheme

Qing YE^1,²,Yun YANG³,Shi-hui ZHENG²,Li-wei CHANG²,Da XIAO²,Yi-xian YANG⁴

¹ College of Computer Science and Technology,Henan Polytechnic University,Jiaozuo 454000,China
² Information Security Center,Beijing University of Posts and Telecommunications,Beijing 100876,China
³ Information Technology Center,Ministry of Railways,Beijing 100010,China
⁴ National Engineering Laboratory for Disaster Backup and Recovery,Beijing University of Posts and Telecommunications,Beijing 100876,China

Online:2014-03-25 Published:2017-08-17
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fundamental Research Funds for the Central Universities;The Fundamental Research Funds for the Central Universities

摘要/Abstract

摘要：

Tonien等在ISC2006上首次提出了多方并发签名体制，但Xie和谭指出Tonien等的方案并不满足公平性，进而分别重新构造了多方并发签名方案。分别对Xie和谭的多方并发签名方案进行了分析，指出他们的方案也不满足公平性，进而正式定义了公平多方并发签名的安全模型，并基于双线性对及多方密钥协商技术重新构造了一个多方并发签名方案。分析表明，在随机预言模型下，假设 CDH 问题是难解的，新方案同时满足正确性、不可伪造性、模糊性、并发性和公平性，并且与同类方案相比，新方案在签名长度、计算量、通信代价方面效率较高。

关键词: 多方并发签名, 公平性, 双线性对, 随机预言模型

Abstract:

Multi-party concurrent signatures were first proposed by Tonien et al at ISC2006,but Xie and Tan pointed Tonien et al's scheme doesn't satisfy fairness and they reconstructed multi-party concurrent signature schemes respectively.Through analysis,the multi-party concurrent signature schemes proposed by Xie and Tan don't satisfy fairness either,so a formal security model of fair multi-party concurrent signatures was proposed and a multi-party concurrent signature scheme based on bilinear pairing and multi-party key agreement was also reconstructed.Analysis shows that the new scheme satisfies correctness,unforgeability,ambiguity,concurrency and fairness in the random oracle model assuming the CDH problem is intractable and highly efficient in signature size,computation cost and communication cost compared with other schemes of its kind.

Key words: multi-party concurrent signature, fairness, bilinear pairing, random oracle model

叶青,杨赟,郑世慧,常利伟,肖达,杨义先. 公平的多方并发签名方案[J]. 通信学报, 2014, 35(3): 140-149.

Qing YE,Yun YANG,Shi-hui ZHENG,Li-wei CHANG,Da XIAO,Yi-xian YANG. Fair multi-party concurrent signature scheme[J]. Journal on Communications, 2014, 35(3): 140-149.

图/表 1

参考文献 16

[1]	CHEN L , KUDLA C , PATERSON K G . Concurrent signatures[A]. Eurocrypt 2004[C]. Spriger-Verlag, Berlin, 2004. 287-305.
[2]	SUSILO W , MU Y , ZHANG F . Perfect concurrent signatures schemes[A]. ICICS'04[C]. Malaga,Spain, 2004. 14-26.
[3]	WANG G L , BAO F , ZHOU J Y . The fairness of perfect concurrent signatures[A]. ICICS'06[C]. Springer,Berlin, 2006. 435-451.
[4]	NGUYEN K . Asymmetric concurrent signatures[A]. ICICS'05[C]. Springer-Verlag, Beijing, 2005. 181-193.
[5]	LI Z H , FAN K , LI H . Perfect concurrent signature scheme on conic curve over ring Zn[J]. International Journal of Digital Content Technology and its Applications, 2012,6(18): 10-16.
[6]	ZHANG Z , XU S . Cryptanalysis and improvement of a concurrent signature scheme based on identity[A]. ICSESS 2011[C]. Beijing, 2011. 453-456.
[7]	TONIEN D , SUSILO W , SAFAVI-NAINI R . Multi-party concurrent signatures[A]. ISC 2006[C]. Samos Island,Greece, 2006. 131-145.
[8]	XIE J T . Fair multi-party concurrent signatures[D]. China,Taiwan:National Central University, 2008.
[9]	WANG L L . Multi-party concurrent signatures based on short ring signatures[A]. WCNIS2010[C]. Beijing,China, 2010. 515-517.
[10]	谭肖．具备非连接性的公平多方并发签名体制[D]．上海：复旦大学， 2010. TAN X . Unlinkable Fair Multi-party Concurrent Signatures[D]. Shanghai: Fudan University, 2010.
[11]	CHOW S S M , YIU S M , HUI L C . Efficient identity based ring signature[A]. ACNS'05[C]. New York, 2005. 499-512.
[12]	WANG L L , ZHANG G Y , MA C G . ID-based deniable ring authentication with constant-size signature[J]. Frontiers of Computer Science in China, 2008,2(1): 106-112.
[13]	YUEN T H . Contributions to Pairing-based Cryptography[D]. Wollongong: University of Wollongong, 2010.
[14]	FELDMAN P . A practical scheme for non-interactive verifiable secret sharing[A]. Proc of 28th FOCS[C]. IEEE,California,USA, 1987. 427-437.
[15]	JUST M , VAUDENAY S . Authenticated multi-party key agreement[A]. ASIACRYPT '96[C]. 1996. 36-49.
[16]	HUANG Q , YANG G M , WONG D S . A new efficient optimistic fair exchange protocol without random oracles[J]. International Journal of Information Security, 2012,11(1): 53-63.

相关文章 15

[1]	孙彦景, 程枫陟, 周家思, 李松. 公平性驱动的RSMA-SDMA预编码设计[J]. 通信学报, 2022, 43(4): 177-185.
[2]	姜占鹏, 孙铭玮, 黄海, 徐江, 刘志伟, 白瑞, 方舟, 曲家兴. 面向双线性对的 $F_{p^{2}}$ -FIOS模乘算法及其实现架构研究[J]. 通信学报, 2022, 43(2): 100-108.
[3]	叶迎晖,施丽琴,卢光跃. 反向散射辅助的无线供能通信网络中用户能效公平性研究[J]. 通信学报, 2020, 41(7): 84-94.
[4]	王竹,袁青云,郝凡凡,房梁,李凤华. 基于链路容量的多路径拥塞控制算法[J]. 通信学报, 2020, 41(5): 59-71.
[5]	谭国真,韩国栋,张福新,丁男,刘明剑. 基于网络效用最大化理论的分布式车联网拥塞控制策略[J]. 通信学报, 2019, 40(2): 82-91.
[6]	徐明,李旭如,刘朝斌,马尧. 基于双重代理密钥的船舶自组网门限签名方案[J]. 通信学报, 2018, 39(7): 166-175.
[7]	李晓伟,杨邓奇,陈本辉,张玉清. 基于生物特征和口令的双因子认证与密钥协商协议[J]. 通信学报, 2017, 38(7): 89-95.
[8]	宋成,张明月,彭维平,贾宗璞,刘志中,闫玺玺. 基于双线性对的车联网批量匿名认证方案研究[J]. 通信学报, 2017, 38(6): 49-57.
[9]	张恩,耿魁,金伟,李勇俊,孙韵清,李凤华. 抗隐蔽敌手的云外包秘密共享方案[J]. 通信学报, 2017, 38(5): 57-65.
[10]	苏成龙,金光,江先亮,钮俊. 公平和低时延的主动队列管理算法研究[J]. 通信学报, 2017, 38(5): 199-206.
[11]	宋成,张明月,彭维平,贾宗璞,刘志中,闫玺玺. 基于非线性对的车联网无证书批量匿名认证方案研究[J]. 通信学报, 2017, 38(11): 35-43.
[12]	谢显中,卢华兵,施赵媛. 基于轮询机制的公平高效机会干扰对齐算法[J]. 通信学报, 2017, 38(10): 1-9.
[13]	杜红珍,温巧燕. 无证书强指定验证者多重签名[J]. 通信学报, 2016, 37(6): 20-28.
[14]	王洁,蔡永泉,田有亮. 基于博弈论的门限签名体制分析与构造[J]. 通信学报, 2015, 36(5): 148-155.
[15]	朱更明,王志强,李哲涛,李仁发. 信道公平分配的局部拥塞控制算法[J]. 通信学报, 2015, 36(4): 9-18.

方案	签名总长度	签名计算量	内部验证计算量	绑定验证总计算量	通信代价
Tonien方案	O(n²)	(n-1)P+(n-1)E+(n-1)H+(n+1)S	3P+E+H+nS	4nP+nH+ (n²+n)S	O(n²)
Xie方案1	O(n)	E	E	nE	O(n)
Xie 方案2	O(n)	E	2E	2 nE	O(n)
Tan方案1	O(n²)	2nE	2nE	(2n²+n)E	O(n²)
Tan方案2	O(n²)	2nE	2nE	2n²E	O(n²)
Huang方案	O(n)	(2n+11)S	2P +nS	5nP + 2n²S	O(n)
本文方案	O(n)	H+S	2P+H	2nP+nH	O(n)

公平的多方并发签名方案

Fair multi-party concurrent signature scheme

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 1

参考文献 16

相关文章 15

Metrics

推荐阅读 0