ACM Transactions on Computer Systems (TOCS)
A calculus of mobile processes, I
Information and Computation
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Proof Techniques for Cryptographic Processes
SIAM Journal on Computing
A Bisimulation Method for Cryptographic Protocols
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
On Bisimulations for the Spi Calculus
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Testing Equivalence for Processes
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Reasoning about Cryptographic Protocols in the Spi Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Proof Techniques for Cryptographic Processes
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
CVS: A Compiler for the Analysis of Cryptographic Protocols
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
What do we mean by entity authentication?
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
| Hi-index | 0.00 |
Bisimulation as a technique could be well invested for proving authenticity and secrecy properties of cryptographic protocols to gain the legality of protocol optimization. In this paper, we will do some changes in the spi-calculus after the original work of M. Abadi and A. Gordan. Then we will introduce evade bisimulation following Abadi and Gordan's framed bisimulation proposal, in which a convenient proof technique is presented. It will impose minimality requirements on the environment and detect the limit beyond which the bisimilarity is kept valid and furthermore it will avoid quantification over contexts. Also, it will give a solution for input transitions for the case of finite processes. Based on the revised spi-calculus would be used to prove that evade bisimilarity, an equivalence relation, is decidable for main security properties: Authenticity and Secrecy.