Bounded memory Dolev-Yao adversaries in collaborative systems
DOI10.1016/J.IC.2014.07.011zbMATH Open1360.68860OpenAlexW2005648310MaRDI QIDQ462499FDOQ462499
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
Recommendations
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42) Network protocols (68M12)
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear logic
- On the complexity of linear authorization logics
- A formulation of the simple theory of types
- Using encryption for authentication in large networks of computers
- Title not available (Why is that?)
- Complexity of some problems in Petri nets
- On the symbolic reduction of processes with cryptographic functions.
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- On the security of public key protocols
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- An NP decision procedure for protocol insecurity with XOR
- Breaking and fixing public-key Kerberos
- A rewriting framework and logic for activities subject to regulations
- The classical AI planning problems in the mirror of Horn linear logic: semantics, expressibility, complexity
- Title not available (Why is that?)
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Collaborative planning with confidentiality
- Bounding Messages for Free in Security Protocols
- From One Session to Many: Dynamic Tags for Security Protocols
- A linear logic of authorization and knowledge
- Relating state-based and process-based concurrency through linear logic (full-version)
- Formal analysis of Kerberos 5
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)
