Security properties: two agents are sufficient

Authors:
Hubert Comon-Lundh;Véronique Cortier
Affiliations:
Laboratoire Spécification et Vérification, CNRS, INRIA, Ecole Normale Supérieure de Cachan;Laboratoire Spécification et Vérification, CNRS, INRIA, Ecole Normale Supérieure de Cachan
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 20
Cited 17

A transformational approach to negation in logic programming

Journal of Logic Programming
Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
Towards a completeness result for model checking of security protocols

Journal of Computer Security
Strand spaces: proving security protocols correct

Journal of Computer Security
The inductive approach to verifying cryptographic protocols

Journal of Computer Security
Constraint solving for bounded-process cryptographic protocol analysis

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
On Name Generation and Set-Based Analysis in the Dolev-Yao Model

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Mechanized proofs for a recursive authentication protocol

CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Towards Automatic Verification of Authentication Protocols on an Unbounded Network

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
How to Prevent Type Flaw Attacks on Security Protocols

CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
A Bound on Attacks on Payment Protocols

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Proving Secrecy is Easy Enough

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocol Insecurity with Finite Number of Sessions is NP-Complete

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Computing Symbolic Models for Verifying Cryptographic Protocols

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Protocol-Independent Secrecy

SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
On the security of multi-party ping-pong protocols

SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
The modelling and analysis of security protocols: the csp approach

The modelling and analysis of security protocols: the csp approach
Compiling and verifying security protocols

LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Pattern-based abstraction for verifying secrecy in protocols

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

CDiff: a new reduction technique for constraint-based analysis of security protocols

Proceedings of the 10th ACM conference on Computer and communications security
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
To infinity and beyond or, avoiding the infinite in security protocol analysis

Proceedings of the 2006 ACM symposium on Applied computing
On the relationships between models in protocol verification

Information and Computation
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying

ACM Transactions on Computational Logic (TOCL)
Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Metareasoning about Security Protocols using Distributed Temporal Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Approximation-based tree regular model-checking

Nordic Journal of Computing
New decidability results for fragments of first-order logic and application to cryptographic protocols

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Cryptographic protocol verification using tractable classes of horn clauses

Program analysis and compilation, theory and practice
Automated analysis of infinite scenarios

TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Distributed temporal logic for the analysis of security protocol models

Theoretical Computer Science
Symbolic and cryptographic analysis of the secure WS-ReliableMessaging scenario

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Integrating automated and interactive protocol verification

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Cryptographic protocol analysis on real c code

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Analysing routing protocols: four nodes topologies are sufficient

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Reduction of equational theories for verification of trace equivalence: re-encryption, associativity and commutativity

POST'12 Proceedings of the First international conference on Principles of Security and Trust

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider arbitrary cryptographic protocols and security properties. We show that it is always sufficient to consider a bounded number of agents b (actually b = 2 in most of the cases): if there is an attack involving n agents, then there is an attack involving at most b agents.