Showing cs.LOShow all
2 papers · 1 filter
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-…
cs.LO2023
Solving the insecurity problem for assertions
R Ramanujam, Vaishnavi Sundararajan, S P Suresh
In the symbolic verification of cryptographic protocols, a central problem is deciding whether a protocol admits an execution which leaks a designated secret to the malicious intru…