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

doi:10.3969/j.issn.0372-2112.2017.01.027

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

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

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

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 Qiao^1,2, TIAN You-liang^2,3

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)

摘要/Abstract

摘要：

秘密共享方案的信息率是衡量秘密共享通信效率的重要指标，鉴于已有的秘密共享方案效率不高的问题，本文基于多线性对提出了信息率为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

中图分类号:

TP309

彭巧, 田有亮. 基于多线性Diffie-Hellman问题的秘密共享方案[J]. 电子学报, 2017, 45(1): 200-205.

PENG Qiao, TIAN You-liang . A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem[J]. Acta Electronica Sinica, 2017, 45(1): 200-205.

参考文献

[1] SHAMIR A.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
[2] BLAKLEY G R.Safeguarding cryptographic keys[A].Proceedings of the National Computer Conference[C].Germany:Springer-Verlag,1979,48:313-317.
[3] CHOR B,DOLDWASSER S,MICALI S,et al.Presence of faults[A].Proc 26th IEEE Symposium on Foundations of Computer Sciences (FOCS'85)[C].Los Angeles,1985.383-395.
[4] Feldman P.A practical scheme for non-interactive verifiable secret sharing[A].Proc 28th IEEE Symposium on Foundations of Computer Sciences(FOCS'87)[C].Los Angeles,1987.427-438.
[5] Heidarvand S,Villar J L.Public verifiability from pairings in secret sharing schemes[A].International Workshop on Selected Areas in Cryptography (SAC 2008)[C].Springer Berlin Heide-lberg,2008.294-308.
[6] MTOPA H.How to share a secret with cheaters[J].Journal of Cryptology,1988,1(2):133-138.
[7] 田有亮,马建峰,彭长根.椭圆曲线上的信息论安全的可验证秘密共享方案[J].通信学报,2011,32(12):96-102. Tian Y L,Ma J F,Peng C G.Information-theoretic secure verifiable secret sharing scheme on elliptic curve group[J].Journal on Communications,2011,32(12):96-102.(in Chinese)
[8] BONEH D,FRANKLIN M.Identity-based encryption from the Weil pairing[J].SIAM,J Compute,2003,32(3):586-615.
[9] BAI F,et al.The IMPORTANT framework for analyzing the impact of mobility on performance of routing for Ad Hoc networks[J].Ad Hoc Networks,2003,1(4):383-403.
[10] 许春香,傅小彤,肖国镇.预防欺诈的矢量空间秘密共享方案[J].西安电子科技大学学报:自然科学版,2002,29(4):527-529. XU C X,FU X T,XIAO G Z.A vector space secret sharing scheme against cheating[J].Journal of Xidian University:Natural Science,2002,29(4):527-529.(in Chinese)
[11] CORON J S,LEPOINT T,TIBOUCHI M.Practical multilinear maps over the integers[A].Advances in Cryptology-Crypto[C].BERLIN:SPINGER-VERLAG,2013.476-493.
[12] 张敏情,张腾飞,王绪安.基于多线性映射的可公开验证加密[J].武汉大学学报,2014,60(6):507-512. Zhang M Q,Zhang T F,Wang X A.Publicly verifiable encryption in multilinear maps[J].Journal of Wuhan University,2014,60(6):507-512.(in Chinese)
[13] Coron J S,Lepoint T,Tibouchi M.Practical Multilinear Maps Over the Integers[A].Advances in Cryptology-CRYPTO 2013[M].Berlin Heidelberg Springer,2013,476-493.
[14] 田有亮,彭长根.基于双线性对的可验证秘密共享方案[J].计算机应用,2007,27(B12):125-127. Tian Y L,Peng C G.Verifiable secret sharing scheme based on bilinear pairing[J].Computer Applications,2007,27(B12):125-127.(in Chinese)
[15] 田有亮,彭长根.基于双线性对的可验证秘密共享方案及其应用[J].计算机工程,2009,35(10):158-161. Tian Y L,Peng C G.Verifiable secret sharing and its applications based on bilinear pairings[J].Computer Engineering,2009,35(10):158-161.(in Chinese)
[16] 李慧贤,庞辽军.基于双线性变换的可证明安全的秘密共享方案[J].通信学报,2008,29(10):45-49. Li H X,Pang L J.Provably secure secret sharing scheme based on bilinear maps[J].Journal on Communications,2008,29(10):45-49.(in Chinese)
[17] PEDERSON T P.Non-interactive and information theoretic secure verifiable secret sharing[A].Cryptology-CRYPTO' 91[C].Berlin:Springer-Verlag,1992.129-140.
[18] 庞辽军,王育民.基于RSA密码体制(t,n)门限秘密共享方案[J].通信学报,2005,26(6):70-73. Pang L J,Wang Y M.Secret sharing scheme based on RSA cryptosystem(T,n)threshold[J].Journal on Communications,2005,26(6):70-73.(in Chinese)

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

A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

[1]	宋云, 李志慧, 李永明. 含至多四个参与者的量子秘密共享方案的最优信息率[J]. 电子学报, 2014, 42(10): 1951-1956.
[2]	赵俊忠;黄厚宽;田盛丰. 确定性退火算法在"伪装"入侵行为检测中的应用[J]. 电子学报, 2004, 32(2): 303-305.
[3]	许春香;陈恺;肖国镇. 安全的矢量空间秘密共享方案[J]. 电子学报, 2002, 30(5): 715-718.