电子学报2017，Vol.45Issue(1)：200-205,6.DOI:10.3969/j.issn.0372-2112.2017.01.027
基于多线性Diffie-Hellman问题的秘密共享方案
A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem
摘要
Abstract
Information rate of secret sharing scheme is an important indicator to measure the communication efficiency of secret sharing,in view of the problem that the existing secret sharing schemes efficiency are not high,a verifiable secret sharing scheme with information rate for m/(mn + 1) was proposed based on multiple linear.In this scheme,the shared secret is m dimensional vector,the verifiability can be achieved by using the multiple linear pair property of multilinear map.And,as well,the scheme is provably secure under the multilinear Diffie-Hellman problem.The performance analysis results show that this scheme has a higher communication efficiency compared with the existing secret sharing schemes under the same level of security,which is more suitable for those data fault-tolerant communication limited application scenarios.关键词
可验证的秘密共享/多线性映射/信息率/多线性Diffie-Hellman问题Key words
verifiable secret sharing/multilinear map/information rate/multilinear Diffie-Hellman problem分类
信息技术与安全科学引用本文复制引用
彭巧,田有亮..基于多线性Diffie-Hellman问题的秘密共享方案[J].电子学报,2017,45(1):200-205,6.基金项目
国家自然科学基金(No.61363068,No.61662009) （No.61363068,No.61662009）
中国博士后基金(No.2013M530705) （No.2013M530705）
贵州省自然科学基金(No.20132112) （No.20132112）
贵州大学博士基金(No.2012-024) （No.2012-024）
贵州大学青年基金(No.201305) （No.201305）
贵州大学研究生创新基金(No.2016016) （No.2016016）
