论文标题
基于XTR公共密钥系统
New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system
论文作者
论文摘要
秘密共享主要于1979年提出，以解决关键分布的问题。近几十年来，研究人员提出了许多改进计划。在所有这些方案中，对可验证的多秘密共享（VMS）方案进行了充分研究，这些方案同时共享多个秘密，并感知恶意经销商和参与者。通过指出Dehkordi和Mashhadi在2008年提出的计划无法检测到经销商的某些恶性行为，我们通过在验证阶段添加有效性检查来克服此缺点，提出了两个新的VMSS计划。我们的新方案基于XTR公共密钥系统，可以通过$ GF（p^{2}）$中的计算实现$ GF（p^{6}）$安全性，而无需明确的构造$ gf（p^{6}）$，其中$ p $，其中$ p $是prime。与使用RSA和线性反馈移位寄存器（LFSR）公共密钥加密系统相比，我们的方案可以通过使用跟踪功能实现较短的参数实现相同的安全级别。更重要的是，我们的计划比基于椭圆曲线密码学（ECC）的计划要简单得多。此外，我们的方案是动态的和阈值可变的，这意味着根据实际情况，需要更改参与者，秘密或阈值时实施我们的方案是有效的。
Secret sharing was proposed primarily in 1979 to solve the problem of key distribution. In recent decades, researchers have proposed many improvement schemes. Among all these schemes, the verifiable multi-secret sharing (VMSS) schemes are studied sufficiently, which share multiple secrets simultaneously and perceive malicious dealer as well as participants. By pointing out that the schemes presented by Dehkordi and Mashhadi in 2008 cannot detect some vicious behaviors of the dealer, we propose two new VMSS schemes by adding validity check in the verification phase to overcome this drawback. Our new schemes are based on XTR public key system, and can realize $GF(p^{6})$ security by computations in $GF(p^{2})$ without explicit constructions of $GF(p^{6})$, where $p$ is a prime. Compared with the VMSS schemes using RSA and linear feedback shift register (LFSR) public key cryptosystems, our schemes can achieve the same security level with shorter parameters by using trace function. What's more, our schemes are much simpler to operate than those schemes based on Elliptic Curve Cryptography (ECC). In addition, our schemes are dynamic and threshold changeable, which means that it is efficient to implement our schemes according to the actual situation when participants, secrets or the threshold needs to be changed.
