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

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

A Secret Sharing Scheme Based on Multilinear Diffie-Hellman Problem

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.