摘要
基于Diffie-Hellman判定难题,设计了一种新的数字签密遗嘱协议,其安全性基于有限域上求解离散对数的困难性和在特定条件下求解二次剩余问题的困难性。该协议满足数字签密协议的机密性、不可伪造性等要求,并能抵抗目前情况下的各种攻击。
Based on the thoughts of Diffie-Hellman decision problem and anonymous signature,a new signcryption testament protocol is introduced in the article.The security of the protocol is based on the difficulty of solving discrete logarithm in finite field and quadratic residue on some special conditions.The new protocol satisfies all the requirements of the confidentiality and unforgeability by signcryption protocol,and it can defend against all those current attacks.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第27期91-93,共3页
Computer Engineering and Applications
基金
国家自然科学基金(No.10571113)
陕西省教育厅科学研究计划(自然科学项目)(No.2010JK829)
徐州工程学院校科研项目(No.XKY2007318)~~
关键词
门限群签名
遗嘱协议
二次剩余问题
计算复杂度
threshold group signature
testament protocol
quadratic residues problem
computation complexity