Bounded memory Dolev-Yao adversaries in collaborative systems

DOI10.1016/j.ic.2014.07.011zbMath1360.68860OpenAlexW2005648310MaRDI QIDQ462499

Tajana Ban Kirigin, Vivek Nigam, Andrej Scedrov, Max I. Kanovich

Publication date: 20 October 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.07.011

zbMATH Keywords

complexity resultsprotocol securitycollaborative systems

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12) Agent technology and artificial intelligence (68T42)

Related Items (6)

On the complexity of verification of time-sensitive distributed systems ⋮ A rewriting framework and logic for activities subject to regulations ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ A framework for linear authorization logics ⋮ On composition of bounded-recall plans ⋮ Bounded memory protocols

Cites Work

• Bounded memory Dolev-Yao adversaries in collaborative systems
• Collaborative planning with confidentiality
• An NP decision procedure for protocol insecurity with XOR
• Linear logic
• Relating state-based and process-based concurrency through linear logic (full-version)
• Formal analysis of Kerberos 5
• Complexity of some problems in Petri nets
• On the symbolic reduction of processes with cryptographic functions.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Breaking and fixing public-key Kerberos
• Relationships between nondeterministic and deterministic tape complexities
• A rewriting framework and logic for activities subject to regulations
• On the Complexity of Linear Authorization Logics
• On the security of public key protocols
• Using encryption for authentication in large networks of computers
• The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Bounding Messages for Free in Security Protocols
• From One Session to Many: Dynamic Tags for Security Protocols
• A formulation of the simple theory of types
• A Linear Logic of Authorization and Knowledge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded memory Dolev-Yao adversaries in collaborative systems