Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulations in the join-calculus
Theoretical Computer Science
On the symbolic reduction of processes with cryptographic functions
Theoretical Computer Science
Analysis of security protocols as open systems
Theoretical Computer Science
On Bisimulations for the Spi Calculus
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Symbolic Trace Analysis of Cryptographic Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Framework for the Analysis of Security Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Compositional Reasoning in the Spi-calculus
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Types for Cryptographic Protocols
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Logical relation for encryption
Journal of Computer Security - Special issue on CSFW14
A bisimulation for dynamic sealing
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Authenticity by tagging and typing
Proceedings of the 2004 ACM workshop on Formal methods in security engineering
A bisimulation for type abstraction and recursion
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations for the spi calculus
Mathematical Structures in Computer Science
Non-interference proof technique for the analysis of cryptographic protocols
Journal of Computer Security - Special issue on WITS'03
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Dynamic types for authentication
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new knowledge representation strategy for cryptographic protocol analysis
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Logical bisimulations and functional languages
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Guessing attacks and the computational soundness of static equivalence
Journal of Computer Security
Environmental bisimulations for higher-order languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Guessing attacks and the computational soundness of static equivalence
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decidability of Equivalence of Symbolic Derivations
Journal of Automated Reasoning
Evaluation technique in the spicalculus for cryptographic protocols
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
Using admissible interference to detect denial of service vulnerabilities
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Hi-index | 0.01 |
Contextual equivalences for cryptographic process calculi can be used to reason about correctness of protocols, but their definition suffers from quantification over all possible contexts.Here, we focus on two such equivalences, may-testing and barbed equivalence, and investigate tractable proof methods for them. To this aim, we develop an `environment-sensitive' labelled transition system, where transitions are constrained by the knowledge the environment has of names and keys.On top of the new transition system, a trace equivalence and a co-inductive weak bisimulation equivalence are defined, both of which avoid quantification over contexts. Our main results are soundness of trace semantics and of weak bisimulation with respect to may-testing and barbed equivalence, respectively.This leads to more direct proof methods for equivalence checking. The use of such methods is illustrated via a few examples concerning implementation of secure channels by means of encrypted public channels. We also consider a variant of the labelled transition system that gives completeness, but is less handy to use.