Bounded memory protocols
From MaRDI portal
Recommendations
- Bounds on shared memory for mutual exclusion
- Bounded-Memory Stream Processing
- Approachability with bounded memory
- Bounded memory folk theorem
- scientific article; zbMATH DE number 2013833
- Tight bounds for shared memory systems accessed by Byzantine processes
- scientific article; zbMATH DE number 7075928
Cites work
- scientific article; zbMATH DE number 559221 (Why is no real title available?)
- scientific article; zbMATH DE number 1759624 (Why is no real title available?)
- 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
- Collaborative planning with confidentiality
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- From One Session to Many: Dynamic Tags for Security Protocols
- On the security of public key protocols
- On the symbolic reduction of processes with cryptographic functions.
- Protection in operating systems
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Using encryption for authentication in large networks of computers
Cited in
(5)
This page was built for publication: Bounded memory protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339157)