Bounded memory protocols

DOI10.1016/j.cl.2014.05.003zbMath1308.68055OpenAlexW1986720226MaRDI QIDQ2339157

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

Publication date: 31 March 2015

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2014.05.003

zbMATH Keywords

complexityundecidabilityprotocol securityDolev-Yao adversarysecrecy problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (2)

A rewriting framework and logic for activities subject to regulations ⋮ A Symbolic Framework to Analyse Physical Proximity in Security Protocols

Uses Software

• Maude

Cites Work

• Unnamed Item
• Unnamed Item
• Bounded memory Dolev-Yao adversaries in collaborative systems
• Collaborative planning with confidentiality
• An NP decision procedure for protocol insecurity with XOR
• On the symbolic reduction of processes with cryptographic functions.
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• A rewriting framework and logic for activities subject to regulations
• On the security of public key protocols
• Protection in operating systems
• Using encryption for authentication in large networks of computers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• From One Session to Many: Dynamic Tags for Security Protocols

This page was built for publication: Bounded memory protocols