对可否认认证进行研究,基于求解离散对数问题的难解性和强单向hash函数的不可逆性,提出了一个新的非交互式的可否认认证协议,并且该协议可以抵抗中间人攻击及伪造攻击.
Deniable authentication protocol was studied in this paper. Based on the intractability of discrete logarithm problem and secure hash function,a new protocol used the non-interactive manner is proposed to efficiently and securely achieve deniable authentication.