机构地区: 山东大学网络信息安全研究所
出 处: 《山东大学学报(理学版)》 2005年第6期44-48,共5页
摘 要: 提出了一个新的前向安全门限签名方案,方案采用乘法共享的方法,实现十分简单,使用的密钥长度也很短,在参与成员n=t+1时,可抵御收买t个成员的窃听敌手.假设因式分解是难解的,证明了方案在随机预言模型中是前向安全的.最后,给出了抵御恶意敌手的方法. A forward-secure threshold signature scheme was put forward. The scheme based on multiplicative secret sharing, with short key, is very simple. If the number of players is n = t + 1, the scheme can tolerate an eavesdropping adversary corrupting t players. It is proved that it is forward secure in random oracle model assuming that factoring is hard. Finally, the method against mobile malicious adversary is given.
领 域: [自动化与计算机技术] [自动化与计算机技术]