3 papers
cs.CR2026
Rational Dolev--Yao Attackers: Decidable Incentive-Aware Verification of Security Protocols in Strategic Logic
Ioana Boureanu, R. Ramanujam
Symbolic protocol verification models the network attacker as a Dolev--Yao (DY) intruder, which does everything its knowledge permits, whether or not it serves any purpose; real ad…
cs.CR2026
Decidability of Parameterised Dolev-Yao Secrecy
Ioana Boureanu, R. Ramanujam, Srinibas Swain
We study the verification of parameterised secrecy for cryptographic protocols in the Dolev-Yao model, where the number of protocol sessions is unbounded and treated as a parameter…
cs.LO2025
Protocol insecurity with finitely many sessions and XOR
R Ramanujam, Vaishnavi Sundararajan, S P Suresh
We present a different proof of the insecurity problem for XOR, solved in by Chevalier, Kuesters, Rusinowitch and Turuani (2005). Our proof uses the notion of typed terms and well-…