摘要
探讨了安全高效的广义 VSS协议的设计问题 ,基于大素数阶有限域上计算离散对数的困难性和拉格朗日插值法 ,提出了一个可适用于任意接入结构的无条件安全的广义 VSS协议 ,与已有的同类协议相比 ,大大减少了秘密信息的存储量 ,具有很高的信息速率 .在计算复杂性方面与目前已有的高效门限 VSS方案相差不大 .由于其安全性、效率及代数结构方面的特点 ,这样的协议将会在分布式的密钥管理、分布式的容错计算、面向群体的密码学及电子商务中得到广泛的应用 .
The problem of how to design secure and efficient general verifiable secret sharing protocol is discussed. Based on the difficulty of computing discrete logarithm over finite field of large prime order and the method of Lagrange interpolation, an unconditional secure general verifiable secret sharing protocol applicable to arbitrary access structures is presented. Compared with the protocols of the same sort, it has a higher information rate and the amount of secret information to be stored by the participants is greatly decreased. With respect to computational complexity, the newly proposed protocol just has a small increase compared with the efficient threshold verifiable secret sharing schemes available. Due to its properties of security, efficiency and algebraic structure, the proposed protocol will find wide applications in distributed key escrow, distributed fault tolerant computation, group oriented cryptography, and electronic commerce.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2002年第10期1199-1204,共6页
Journal of Computer Research and Development
基金
国家自然科学基金 (60 0 73 0 5 2 )
教育部博士点基金 (2 0 0 0 0 70 10 1)资助
