The Interrogator: Protocol Secuity Analysis
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
A calculus of mobile processes, II
Information and Computation
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
An approach to the formal verification of cryptographic protocols
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Communication and Concurrency
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Secrecy by Typing inSecurity Protocols
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
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
Using temporal logic to specify and verify cryptographic protocols
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
SP '96 Proceedings of the 1996 IEEE Symposium on Security and Privacy
Secrecy by typing in security protocols
Journal of the ACM (JACM)
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 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
Automatic testing equivalence verification of spi calculus specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Logical relation for encryption
Journal of Computer Security - Special issue on CSFW14
On the secure implementation of security protocols
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
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
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improving the security of industrial networks by means of formal verification
Computer Standards & Interfaces
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
A bisimulation for dynamic sealing
Theoretical Computer Science
Theoretical Computer Science
Cryptographic logical relations
Theoretical Computer Science
Information flow security in Boundary Ambients
Information and Computation
Implementing Spi Calculus Using Nominal Techniques
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Knowledge Aware Bisimulation and Anonymity
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Formalising Observer Theory for Environment-Sensitive Bisimulation
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the secure implementation of security protocols
ESOP'03 Proceedings of the 12th European conference on Programming
A trace based bisimulation for the spi calculus: an extended abstract
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Guessing attacks and the computational soundness of static equivalence
Journal of Computer Security
A testing theory for a higher-order cryptographic language
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
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
Towards a symbolic bisimulation for the spi calculus
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Recursion versus replication in simple cryptographic protocols
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Automatic detection of attacks on cryptographic protocols: a case study
DIMVA'05 Proceedings of the Second international conference on Detection of Intrusions and Malware, and Vulnerability Assessment
Monotonic set-extended prefix rewriting and verification of recursive ping-pong protocols
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Using admissible interference to detect denial of service vulnerabilities
IWFM'03 Proceedings of the 6th international conference on Formal Methods
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
| Hi-index | 0.00 |
We introduce a definition of bisimulation for cryptographic protocols. The definition includes a simple and precise model of the knowledge of the environment with which a protocol interacts. Bisimulation is the basis of an effective proof technique, which yields proofs of classical security properties of protocols and also justifies certain protocol optimizations. The setting for our work is the spi calculus, an extension of the pi calculus with cryptographic primitives. We prove the soundness of the bisimulation proof technique within the spi calculus.