Skip to main content
Journal ArticleOPEN ACCESS

Security properties: Two agents are sufficient

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2618 99-113
DOI: 10.1007/3-540-36575-3_8
33Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Comon-Lundh, H., & Cortier, V. (2003). Security properties: Two agents are sufficient. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2618, 99–113. https://doi.org/10.1007/3-540-36575-3_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free