基于双线性对的可公开验证多秘密共享方案

doi:10.3969/j.issn.1000-3428.2014.09.031

计算机工程

基于双线性对的可公开验证多秘密共享方案

尚雪娇,杜伟章

(长沙理工大学计算机与通信工程学院,长沙410114)

收稿日期:2013-08-19 出版日期:2014-09-15 发布日期:2014-09-12
作者简介:尚雪娇(1988 - ),女,硕士研究生,主研方向:信息安全;杜伟章,教授、博士。

Publicly Verifiable Multi-secret Sharing Scheme Based on Bilinear Pairings

SHANG Xue-jiao,DU Wei-zhang

(College of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China)

Received:2013-08-19 Online:2014-09-15 Published:2014-09-12

摘要/Abstract

摘要： 现有可公开验证多秘密共享方案只能由Lagrange 插值多项式构造,且共享的秘密仅限于有限域或加法群。为解决上述问题,提出一个基于双线性对的可公开验证多秘密共享方案。该方案中每个参与者需持有2 个秘密份额来重构多个秘密,并且在秘密分发的同时生成验证信息。任何人都可以通过公开的验证信息对秘密份额的有效性进行验证,及时检测分发者和参与者的欺骗行为。在秘密重构阶段采用Hermite 插值定理重构秘密多项式,并结合双线性运算重构秘密。分析结果表明,在双线性Diffie-Hellman 问题假设下,该方案能抵抗内外部攻击,具有较高的安全性。

关键词: 双线性对, 秘密共享, 多秘密共享, 秘密份额, Hermite 插值, 双线性Diffie-Hellman 问题

Abstract: In order to solve the problems that the previous publicly verifiable multi-secret sharing schemes can be constructed only by Lagrange interpolation polynomial and the shared secret is limited to the finite field or additive group,a publicly verifiable multi-secret sharing scheme based on bilinear pairings is proposed. In the scheme,each participant has to hold two shares for reconstructing multiple secrets,and the verification information is generated in the process of secret distribution. According to public verification information,anyone can verify the validity of secret shares. Cheating of dealer and participants can be detected in time. In the secret reconstructing process,Hermite interpolation theorem is used to reconstruct the secret polynomial,and bilinear operation is combined to reconstruct the secret. Under the assumptions of Bilinear Diffie-Hellman Problem(BDHP),the analysis result shows that this scheme can resist internal and external attacks and is a secure and efficient multi-secret sharing scheme.

Key words: bilinear pairings, secret sharing, multi-secret sharing, secret share, Hermite interpolation, Bilinear Diffie- Hellman Problem(BDHP)

中图分类号:

TP309

尚雪娇,杜伟章. 基于双线性对的可公开验证多秘密共享方案[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2014.09.031.

SHANG Xue-jiao,DU Wei-zhang. Publicly Verifiable Multi-secret Sharing Scheme Based on Bilinear Pairings[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2014.09.031.

http://www.ecice06.com/CN/Y2014/V40/I9/155

参考文献

参考文献 [ 1 ]　Fall K. A Delay-tolerant Network Architecture for Challenged Internets[C] / / Proc. of SIGCOMM’03. [S. 1. ]: IEEE Press,2003:27-34. [ 2 ]　苏金树,胡乔林,赵宝康,等. 容延容断网络路由技术 [J]. 软件学报,2010,21(1):119-122. [ 3 ]　Vahdat A, Becker D. Epidemic Routing for Partially Connected Ad Hoc Networks[R]. Durham,USA:Duke University,Technical Report:CS-2000-06,2000. [ 4 ]　Lindgren A, Schelen D O. Probabilistic Routing in Intermittently Connected Networks[J]. Mobile Computing Communications,2003,7(3):19-20. [ 5 ]　Spyropoulos T,Psounis K,Raghavendra C S. Efficient Routing in Intermittently Connected Mobile Networks: the Multiple-copy Case [ J ]. IEEE / ACM Trans. on Network,2008,16(1):77-90. [ 6 ]　Balasubramanian A,Levine B N,Venkataramani A. DTN Routing As A Resource Allocation Problem[C]/ / Proc. of ACM SIGCOMM’ 07. Kyoto, Japan: ACM Press,2007: 373-384. [ 7 ]　Motani M,Srinivasan V,Nuggehalli P. PeopleNet:Engineering A Wireless Virtual Social Network[C] / / Proc. of MobiCom’05. [S. 1. ]:IEEE Press,2005:243-257. [ 8 ]　Hui P,Chaintreau A,Scott J,et al. Pocket Switched Networks and Human Mobility in Conference Environments [C]/ / Proc. of SIGCOMM’05. [S. 1. ]:IEEE Press,2005: 212-219. [ 9 ]　赵广松,陈　鸣. 自私性机会网络中激励感知的内容分发的研究[J]. 通信学报,2013,34(2):73-84. [10]　Xu Z,Jin Y,Shu W,et al. Sred:A Secure Reputation-based Dynamic Window Scheme for Disruption-tolerant Networks [C]/ / Proc. of MILCOM’09. Boston,USA:[s. n. ],2009: 1-7. [11]　Li N,Das S K. A Trust-based Framework for Data Forwarding in Opportunistic Networks [ J]. Ad Hoc Networks, 2013,11(4):1497-1509. [12]　Dini G, Duca a l. Towards Reputation-based Routing Protocol to Contrast Blackholes in A Delay Tolerant Network [ EB / OL ] / / ( 2012-10-10 ). http:/ / dx. doi. org / 10. 1016/ j. adhoc. 2012. 03. 003. [13]　Li F,Wu J,Avinash S. Thwarting Blackhole Attacks in Disruption Tolerant Networks Using Encounter Tickets [C] / / Proc. of INFOCOM’ 09. Riode Janeiro,Brazil: [s. n. ],2009:2428-2436. [14]　Ren Y,Chuah M C,Yang J,et al. Detecting Blackhole Attacks in Disruption-tolerant Networks Through Packet Exchange Recording [ C ] / / Proc. of WoWMoM ’ 10. Montreal,Canada:[s. n. ],2010:1-6. [15]　Chuah M,Yang P. Impact of Selective Dropping Attacks on Network Coding Performance in DTNS and A Potential Mitigation Scheme[C] / / Proc. of ICCCN’09. San Francisco,USA:[s. n. ],2009:1-6. [16]　Keranen A. Opportunistic Network Environment Simulator[ D]. Helsinki,Finland:Helsinki University of Technology, 2008. [17]　Eagle A,Pentland A,Lazer D. Inferring Social Network Structure Using Mobile Phone Data [ C ] / / Proc. of PNAS’09. [S. 1. ]:IEEE Press,2009:15274-15278. 编辑　索书志

[1]	唐敏, 张宇浩, 邓国强. 一种高效的非交互式隐私保护逻辑回归模型[J]. 计算机工程, 2023, 49(4): 32-42,51.
[2]	郑云涛, 叶家炜. 基于茫然传输协议的FATE联邦迁移学习方案[J]. 计算机工程, 2023, 49(2): 24-30.
[3]	张超, 彭长根, 丁红发, 许德权. 基于国密SM9的可搜索加密方案[J]. 计算机工程, 2022, 48(7): 159-167.
[4]	徐鑫, 温蜜. 基于数据库驱动认知无线电网络的位置隐私保护方案[J]. 计算机工程, 2022, 48(2): 164-172.
[5]	夏高, 何成万. 一种基于异或运算的(k,n)门限秘密共享算法[J]. 计算机工程, 2021, 47(10): 111-115,124.
[6]	邓志辉, 王少辉, 王平. 基于合数阶双线性对的可搜索加密方案分析与改进[J]. 计算机工程, 2020, 46(9): 123-128,135.
[7]	周能, 张敏情, 林文兵. 基于秘密共享的可分离密文域可逆信息隐藏算法[J]. 计算机工程, 2020, 46(10): 112-119.
[8]	孙海燕, 李玲玲, 张玲, 张建伟, 黄万伟. 一种增强的移动互联网身份基认证密钥协商协议[J]. 计算机工程, 2019, 45(9): 153-160,182.
[9]	解扬,苗付友,白建峰. 基于整数规划的一般访问结构秘密共享方案[J]. 计算机工程, 2019, 45(6): 165-170.
[10]	甘植旺,廖方圆. 国密SM9中R-ate双线性对快速计算[J]. 计算机工程, 2019, 45(6): 171-174.
[11]	左黎明,周庆,陈兰兰. 一种可证安全高效无证书短签名方案[J]. 计算机工程, 2019, 45(6): 193-198.
[12]	吴颖豪,凌捷. 一种改进的云存储数据完整性验证方法[J]. 计算机工程, 2019, 45(3): 36-40.
[13]	左黎明, 夏萍萍, 陈祚松. 一种可证安全的短盲签名方案[J]. 计算机工程, 2019, 45(12): 114-118.
[14]	倪绿林,许春根. 基于身份的动态可搜索加密方案[J]. 计算机工程, 2019, 45(1): 136-140.
[15]	梁才,涂国庆,刘梦君. 基于属性加密的细粒度家庭文件安全共享方案[J]. 计算机工程, 2018, 44(4): 206-211.

选择文件类型/文献管理软件名称

选择包含的内容

基于双线性对的可公开验证多秘密共享方案

Publicly Verifiable Multi-secret Sharing Scheme Based on Bilinear Pairings

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

模态框（Modal）标题

选择文件类型/文献管理软件名称

选择包含的内容

基于双线性对的可公开验证多秘密共享方案

Publicly Verifiable Multi-secret Sharing Scheme Based on Bilinear Pairings

PDF

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价