A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem

PENG Qiao; TIAN You-liang

doi:10.3969/j.issn.0372-2112.2017.01.027

您当前的位置：

首页 >

文章列表页 >

A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem

更新时间：2025-07-16

- A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem
- Acta Electronica Sinica Vol. 45, Issue 1, Pages: 200-205(2017)
- 作者机构：
  
  1. 贵州大学数学与统计学院,贵州,贵阳,550025
  2. 贵州省公共大数据重点实验室,贵州,贵阳,550025
  3. 贵州大学计算机科学与技术学院,贵州,贵阳,550025
  4. 贵州大学数学与统计学院,贵州,贵阳,550025
  5. 贵州省公共大数据重点实验室,贵州,贵阳,550025
  6. 贵州大学计算机科学与技术学院,贵州,贵阳,550025
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2017.01.027
  CLC： TP309
- Published Online：25 January 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
PENG Qiao, TIAN You-liang. A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem[J]. Acta Electronica Sinica, 2017, 45(1): 200-205.
DOI：

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

摘要

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

（

+1）的可验证秘密共享方案.方案中，共享秘密为

维向量，其可验证性可利用多线性映射的多线性性质来实现；同时，在多线性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

(

+1) was proposed based on multiple linear.In this scheme

the shared secret is

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.

关键词

Keywords

references

Views

633

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Secure Vector Space Secret Sharing Scheme

The Optimal Information Rate of Quantum-Secret-Sharing Schemes Based on at Most Four Participants

Related Author

XU Chun-xiang

CHEN Kai

XIAO Guo-zhen

SONG Yun

LI Zhi-hui

LI Yong-ming

Related Institution

Institute of Information Security,ISN,Xidian University

College of Mathematics and Information Science, Shaanxi Normal University

College of Computer Science, Shaanxi Normal University

College of Mathematics and Information Science Shaanxi Normal University Xi'an Shaanxi China

College of Computer Science Shaanxi Normal University Xi'an Shaanxi China

⁰