Based on our previous work on truly concurrent process algebras APTC, we use it to verify the security protocols. This work (called Secure APTC, abbreviated SAPTC) have the following advantages in verifying security protocols: (1) It has a firmly theoretic foundations, including equational logics, structured operational semantics, and axiomatizations between them; (2) It has rich expressive powers to describe security protocols. Cryptographic operations are modeled as atomic actions and can be extended, explicit parallelism and communication mechanism to modeling communication operations and principals, rich computational properties to describing computational logics in the security protocols, including conditional guards, alternative composition, sequential composition, parallelism and communication, encapsulation and deadlock, recursion, abstraction. (3) Especially by abstraction, it is convenient and obvious to observe the relations between the inputs and outputs of a security protocols, including the relations without any attack, the relations under each known attack, and the relations under unknown attacks if the unknown attacks can be described.

中文翻译：

---

安全过程代数

根据我们以前在真正的并发流程代数APTC上的工作，我们使用它来验证安全协议。这项工作（称为Secure APTC，缩写为SAPTC）在验证安全协议方面具有以下优点：（1）它具有牢固的理论基础，包括方程式逻辑，结构化的操作语义以及它们之间的公理化；（2）具有描述安全协议的丰富表达能力。加密操作被建模为原子操作，可以进行扩展，显式并行和通信机制来对通信操作和主体进行建模，丰富的计算属性来描述安全协议中的计算逻辑，包括条件防护，替代组合，顺序组合，并行和通信，封装和死锁，递归，抽象。（3）特别是通过抽象，观察安全协议的输入和输出之间的关系非常方便和明显，包括无任何攻击的关系，每次已知攻击下的关系以及未知攻击下的关系（如果未知攻击）可以描述。