Bounded memory Dolev-Yao adversaries in collaborative systems

DOI10.1016/J.IC.2014.07.011MaRDI QIDQ462499zbMATH OpenOpenAlexFDO

Authors Tajana Ban Kirigin, Vivek Nigam, Max Kanovich, Andre Scedrov

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) Agent technology and artificial intelligence (68T42) Network protocols (68M12)

Recommendations

• Bounded memory protocols
• Computer Science Logic
• A computational interpretation of Dolev-Yao adversaries
• Security properties: two agents are sufficient
• scientific article; zbMATH DE number 1088242

Cites work

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

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462499)