Modular verification of protocol equivalence in the presence of randomness

DOI10.1007/978-3-319-66402-6_12zbMath1496.68058OpenAlexW2639241723MaRDI QIDQ2167715

Rohit Chadha, Mahesh Viswanathan, Matthew S. Bauer

Publication date: 25 August 2022

Full work available at URL: http://hdl.handle.net/2142/96261

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12) Computer security (68M25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decidability of equivalence of symbolic derivations
• Making random choices invisible to the scheduler
• Safely composing security protocols
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Task-structured probabilistic I/O automata
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Composition of password-based protocols
• Automated verification of selected equivalences for security protocols
• A framework for compositional verification of security protocols
• Model checking concurrent programs with nondeterminism and randomization
• Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols
• A Probabilistic Applied Pi–Calculus
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• Cryptographic Protocol Composition via the Authentication Tests
• On the security of public key protocols
• CSP and anonymity
• Mobile values, new names, and secure communication
• Programming Languages and Systems
• Safely Composing Security Protocols
• From One Session to Many: Dynamic Tags for Security Protocols
• Theory of Cryptography

This page was built for publication: Modular verification of protocol equivalence in the presence of randomness