电子学报 ›› 2017, Vol. 45 ›› Issue (1): 200-205.DOI: 10.3969/j.issn.0372-2112.2017.01.027

• 学术论文 • 上一篇    下一篇

基于多线性Diffie-Hellman问题的秘密共享方案

彭巧1,2, 田有亮2,3   

  1. 1. 贵州大学数学与统计学院, 贵州贵阳 550025;
    2. 贵州省公共大数据重点实验室, 贵州贵阳 550025;
    3. 贵州大学计算机科学与技术学院, 贵州贵阳 550025
  • 收稿日期:2015-06-24 修回日期:2016-08-29 出版日期:2017-01-25
    • 通讯作者:
    • 田有亮
    • 作者简介:
    • 彭巧,女,1991年生于湖北孝感.贵州大学数学与统计学院信息安全硕士生.研究方向为信息安全和云计算上的隐私保护、大数据及其密码应用.E-mail:1107304865@qq.com
    • 基金资助:
    • 国家自然科学基金 (No.61363068,No.61662009); 中国博士后基金 (No.2013M530705); 贵州省自然科学基金 (No.20132112); 贵州大学博士基金 (No.2012-024); 贵州大学青年基金 (No.201305); 贵州大学研究生创新基金 (No.2016016)

A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem

PENG Qiao1,2, TIAN You-liang2,3   

  1. 1. College of Mathematics and Statistics, Guizhou University, Guiyang, Guizhou 550025, China;
    2. Guizhou Provincial Key Laboratory of Public Big Data, Guizhou University, Guiyang, Guizhou 550025, China;
    3. College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China
  • Received:2015-06-24 Revised:2016-08-29 Online:2017-01-25 Published:2017-01-25
    • Supported by:
    • National Natural Science Foundation of China (No.61363068, No.61662009); Post-doctoral Foundation of China (No.2013M530705); Natural Science Foundation of Guizhou Province,  China (No.20132112); PhD Fund of Guizhou University (No.2012-024); Youth Foundation of Guizhou University (No.201305); Postgraduate Innovation Fund of Guizhou University (No.2016016)

摘要:

秘密共享方案的信息率是衡量秘密共享通信效率的重要指标,鉴于已有的秘密共享方案效率不高的问题,本文基于多线性对提出了信息率为m/m+1)的可验证秘密共享方案.方案中,共享秘密为m维向量,其可验证性可利用多线性映射的多线性性质来实现;同时,在多线性Diffie-Hellman问题下,方案是可证明安全的.性能分析结果表明,与已有的相同安全级别下的秘密共享方案相比,该方案具有较高的通信效率,更适用于通信受限的数据容错的应用场景.

关键词: 可验证的秘密共享, 多线性映射, 信息率, 多线性Diffie-Hellman问题

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/(m+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.

Key words: verifiable secret sharing, multilinear map, information rate, multilinear Diffie-Hellman problem

中图分类号: