Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient probabilistic public key encryption scheme which hides all partial information
Proceedings of CRYPTO 84 on Advances in cryptology
Efficient and timely mutual authentication
ACM SIGOPS Operating Systems Review
ACM Transactions on Computer Systems (TOCS)
A semantics for a logic of authentication (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Adding time to a logic of authentication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Elements of the Theory of Computation
Elements of the Theory of Computation
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Logical Language for Specifying Cryptographic Protocol Requirements
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Cryptographic protocols
Constraint solving for bounded-process cryptographic protocol analysis
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Guest Editorial: Introduction to the Special Section
IEEE Transactions on Software Engineering
The Logic of Authentication Protocols
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
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Athena: a New Efficient Automatic Checker for Security Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Proceedings of the 2003 ACM workshop on Formal methods in security engineering
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science - Automata, languages and programming
Decidability of context-explicit security protocols
Journal of Computer Security - Special issue on WITS'03
A method for symbolic analysis of security protocols
Theoretical Computer Science
A communication model for structural design objects. II: performatives and protocols
Advances in Engineering Software
A derivation system and compositional logic for security protocols
Journal of Computer Security
Understanding the intruder through attacks on cryptographic protocols
Proceedings of the 44th annual Southeast regional conference
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Cryptographic voting protocols: a systems perspective
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
Secrecy by interpretation functions
Knowledge-Based Systems
A framework for compositional verification of security protocols
Information and Computation
Rewriting Techniques in the Constraint Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
A communication model for structural design objects. II: Performatives and protocols
Advances in Engineering Software
Environmental requirements for authentication protocols
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
EC-RAC: enriching a capacious RFID attack collection
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Vulnerabilities and threats in distributed systems
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
This paper develops a foundation for reasoning about protocol security. We adopt a model-based approach for defining protocol security properties. This allows us to describe security properties in greater detail and precision than previous frameworks. Our model allows us to reason about the security of protocols, and considers issues of beliefs of agents, time, and secrecy. We prove a composition theorem which allows us to state sufficient conditions on two secure protocols A and B such that they may be combined to form a new secure protocol C. Moreover, we give counter-examples to show that when the conditions are not met, the protocol C may not be secure.