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