计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (27): 91-93.

• 网络、通信、安全 • 上一篇    下一篇

基于二次剩余问题的数字签密遗嘱协议

米军利1,谢淑翠2,张建中3   

  1. 1.徐州工程学院 数学与物理科学学院,江苏,徐州 221008
    2.西安邮电学院 应用数理系,西安 710061
    3.陕西师范大学 数学与信息科学学院,西安 710062
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-09-21 发布日期:2011-09-21

Signcryption testament protocol based on quadratic residue

MI Junli1,XIE Shucui2,ZHANG Jianzhong3   

  1. 1.School of Mathematics and Physical Science,Xuzhou Institute of Technology,Xuzhou,Jiangsu 221008,China
    2.Department of Applied Mathematics and Applied Physics,Xi’an University of Posts and Telecommunications,Xi’an 710061,China
    3.College of Mathematics and Information Science,Shaanxi Normal University,Xi’an 710062,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-09-21 Published:2011-09-21

摘要: 基于Diffie-Hellman判定难题,设计了一种新的数字签密遗嘱协议,其安全性基于有限域上求解离散对数的困难性和在特定条件下求解二次剩余问题的困难性。该协议满足数字签密协议的机密性、不可伪造性等要求,并能抵抗目前情况下的各种攻击。

关键词: 门限群签名, 遗嘱协议, 二次剩余问题, 计算复杂度

Abstract: 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.

Key words: threshold group signature, testament protocol, quadratic residues problem, computation complexity