关键词: 安全协议 进程代数 消解 保密性 认证性

Abstract:

Essentially, security protocol can be considered as a set of distributed parallel programs, described as a parallel composition system including sever al sub-processes. We abstract this as a group of logic rules, which makes it possible to do the verification of the interleaving of infinite sessions of  the security protocol. Our thesis proposes the approach to converting the process-algebra-described protocol to the horn logic rules , and proposes the  high-efficiency algorithm of reduction

Key words: security protocol process algebra reduce security authentication