摘要： 研究在密码协议仅使用数字签名原语时，主动攻击下符号形式化分析系统的计算可靠性。借鉴Micciancio-Warinschi方法，分别引入符号模型和计算模型中的协议运行状态集合，通过反证法证明符号模型中的迹与计算模型中的迹之间的对应关系，建立数字签名的计算可靠性，即如数字签名方案满足N-UNF，则符号模型所得到的结果在计算模型中也是正确的。基于该结论，可以构建具有计算可靠性的形式化分析系统。

关键词: 密码协议, 数字签名, 计算可靠性

Abstract: This paper extends previous results bridging the gap between the symbol approach and the computational approach. Specifically, for the case of protocols that use signatures, based on the Micciancio-Warinschi method, the soundness of digital signature with respect to the computational model is established, i.e. if digital signature scheme is N-UNF, then the results obtained form the symbolic model carry over to the computational model. Based on this conclusion, a formal system with computational soundness can be consructed.

Key words: cryptographic protocols, digital signature, computational soundness

中图分类号: 

• TP309