摘要
基于单向函数和有限域上离散对数问题提出一种动态多秘密分享方案.本方案构成简便,容易检测秘密分享成员的欺诈行为,能够解决秘密更新与复用的问题,且可以很方便地增加和删除系统成员.整个方案安全性高,涉及计算复杂度小,需保存信息少,因而效率高且实用。
Based on the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed. It has simple structure, can easily identify the cheaters of all shareholders and can effectively solve the renewal and reuse problems and accept a new participant or fire a participant freely. The scheme is characterized by high security, small computational complexity, and small amount of information that should be kept. The scheme is relatively efficient.
出处
《江汉大学学报（自然科学版）》
2005年第3期67-69,共3页
Journal of Jianghan University：Natural Science Edition
基金
国家自然科学基金资助项目(10271069)
陕西省自然科学基础研究计划资助项目(2004A14)
陕西师大重点科研项目资助课题.
