Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, I
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A calculus for cryptographic protocols
Information and Computation
Model checking
Communication and Concurrency
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Hi-index | 0.00 |
Observational equivalence is a powerful means for formulating the security properties of cryptographic protocols. However suffering from the infinite quantifications over contexts, its proof becomes notoriously troublesome. This paper addresses the problem with a symbolic technique. We propose a symbolic bisimulation for spi calculus based on an environmental sensitive label transition system semantics, which restrict the infinite inputs of a process to only finite transitions. We also prove that the symbolic bisimulation is sound to the traditional concrete bisimulation, and furthermore is a promising means to automatically verifying the security protocols.