Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (21): 8-11.
• 博士论坛 • Previous Articles Next Articles
WANG Quan-lai1,2，WANG Ya-di1，HAN Ji-hong1
Received:
Revised:
Online:
Published:
Contact:
王全来1,2，王亚弟1，韩继红1
通讯作者:
Abstract: Based on the Abadi-Rowgaway computational soundness theorem of formal encryption，this paper proposes and proves our computational soundness theorem of formal analysis of cryptographic protocols.Through the analysis for group key distribution protocols，our soundness theorem is stronger and powerful in adaptive attacks.This paper proposes formal definitions of security for group key distribution protocols both in the formal methods and the computational methods，then proves soundness of the formal definition.
Key words: formal method, computational method, soundness theorem, cryptographic protocol analysis
摘要： 基于Abadi-Rowgaway的形式化加密的计算合理性定理，提出和证明了密码协议形式化分析的计算合理性定理。通过对群密钥分配协议安全性的分析，说明定理对协议的可选择攻击具有较强的分析能力，提出了群密钥分配协议的形式化方法与计算方法下安全性的形式化定义，并证明了其合理性。
关键词: 形式化方法, 计算方法, 合理性定理, 密码协议分析
WANG Quan-lai1,2，WANG Ya-di1，HAN Ji-hong1. Computational soundness of formal analysis of cryptographic protocols[J]. Computer Engineering and Applications, 2007, 43(21): 8-11.
王全来1,2，王亚弟1，韩继红1. 密码协议形式化分析的计算合理性[J]. 计算机工程与应用, 2007, 43(21): 8-11.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2007/V43/I21/8
