3 papers
cs.LO2026
Simplified proofs of Weak Normalization for propositional logic
S P Suresh
We present a new proof of weak normalization for intuitionistic natural deduction. The distinguishing features of this proof are that it works only with cuts rather than cut segmen…
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…