基于格的可验证秘密共享方案

可验证秘密共享是密码学领域中的一项重要分支.以往可验证秘密共享方案的有效性通常是基于离散对数的数学难题,然而离散对数问题已经被证明在量子计算模型下是不安全的.因此,需要借助格难题去实现可以抵抗量子攻击的可验证秘密共享方案.本文分析现有的可验证秘密共享方案,针对现有方案计算效率低和无法抵御量子攻击的缺陷,利用格密码学中的数学难题,提出一种新的可验证秘密共享方案.该方案相对于以往的可验证秘密共享方案,具有更高的计算效率和抗量子攻击的特性.

Verifiable Secret Sharing Scheme Based on Lattice Cryptography

Verifiable Secret Sharing (VSS) is an important cryptographic primitive in distributed computing. The most of pervious VSS almost depended on the commitments which was established under the computational assumption of discrete algorithm problem which had been proofed unsecure. So a quantum-resistant VSS scheme which can be applied in secret sharing schemes implemented by different methods is called for. In this study, we analyze the existing verifiable sharing schemes. In order to solve the flaws in the existing schemes, we propose a new scheme with the applicability to secret sharing implemented by lattice cryptography. In addition, it has higher verification efficiency compared to past schemes and resistance so far to cryptanalysis by quantum algorithms.