摘要
基于中国剩余定理,零知识证明与有限域上计算离散对数问题的困难性,提出了一种新的动态多秘密分享方案.方案可检测秘密分享成员的欺诈,解决秘密更新与子密复用问题,且可以很方便地增删系统成员.整个方案构成新颖、安全性高、计算量小、需要保密与传输的数据量都较小,因而效率高且实用.
Based on the zero -knowledge proofs and the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed in this paper.It can easily identify the cheaters of all shareholders,effectively solve the renewal and reuse problems,and easily and freely accept a new participant or fire a participant.The scheme is of simple structure,high security and small computational complexity.And the amount of data to be kept secret and transferred is very small.So the scheme is relatively efficient and practical.
出处
《咸阳师范学院学报》
2005年第2期5-6,9,共3页
Journal of Xianyang Normal University
基金
国家自然科学基金资助项目(编号:102711069)陕西省自然科学基础研究计划资助项目(编号:2004A14)陕西 师大重点科研项目资助课题。
关键词
秘密分享
离散对数
零知识证明
secret shariug
diserete logarithm
zero-knowledge proof
