ACM Transactions on Computer Systems (TOCS)
Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
A compositional protocol verification using relativized bisimulation
Information and Computation
Adding time to a logic of authentication
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
An attack on the Needham-Schroeder public-key authentication protocol
Information Processing Letters
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Strand spaces: proving security protocols correct
Journal of Computer Security
Using encryption for authentication in large networks of computers
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Action Calculi, or Syntactic Action Structures
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
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
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Modelling and verifying key-exchange protocols using CSP and FDR
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
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
On Unifying Some Cryptographic Protocol Logics
SP '94 Proceedings of the 1994 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Security analysis of network protocols: logical and computational methods
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Deciding knowledge properties of security protocols
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
A modular correctness proof of IEEE 802.11i and TLS
Proceedings of the 12th ACM conference on Computer and communications security
Towards computationally sound symbolic analysis of key exchange protocols
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
A derivation system and compositional logic for security protocols
Journal of Computer Security
Compositional analysis of contract-signing protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
On the semantics of Alice&Bob specifications of security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
A (restricted) quantifier elimination for security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Secure sessions for Web services
ACM Transactions on Information and System Security (TISSEC)
A calculus of challenges and responses
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
Preservation of epistemic properties in security protocol implementations
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
On the protocol composition logic PCL
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Dynamic types for authentication
Journal of Computer Security - Formal Methods in Security Engineering Workshop (FMSE 04)
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Modal tableaux for verifying stream authentication protocols
Autonomous Agents and Multi-Agent Systems
An Automated Approach for Proving PCL Invariants
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of authentication protocols for epistemic goals via SAT compilation
Journal of Computer Science and Technology
Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols
Formal to Practical Security
Semantics and logic for security protocols
Journal of Computer Security
Completeness and Counter-Example Generations of a Basic Protocol Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of EAP-GPSK authentication protocol
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol
Electronic Notes in Theoretical Computer Science (ENTCS)
Refinement types for secure implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Inductive trace properties for computational security
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Modular code-based cryptographic verification
Proceedings of the 18th ACM conference on Computer and communications security
A fibred belief logic for multi-agent systems
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Probabilistic polynomial-time semantics for a protocol security logic
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A temporalised belief logic for specifying the dynamics of trust for multi-agent systems
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Deriving secrecy in key establishment protocols
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
Security protocol verification: symbolic and computational models
POST'12 Proceedings of the First international conference on Principles of Security and Trust
Calculus of cooperation and game-based reasoning about protocol privacy
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We present a logic for proving security properties of protocols that use nonces (randomly generated numbers that uniquely identify a protocol session) and public-key cryptography. The logic, designed around a process calculus with actions for each possible protocol step, consists of axioms about protocol actions and inference rules that yield assertions about protocols composed of multiple steps. Although assertions are written using only steps of the protocol, the logic is sound in a stronger sense: each provable assertion about an action or sequence of actions holds in any run of the protocol that contains the given actions and arbitrary additional actions by a malicious attacker. This approach lets us prove security properties of protocols under attack while reasoning only about the sequence of actions taken by honest parties to the protocol. The main security-specific parts of the proof system are rules for reasoning about the set of messages that could reveal secret data and an invariant ride called the "honesty rule".