4 papers
New Proofs of Weak Normalization for Propositional Logic
S P Suresh
We present new proofs of weak normalization for intuitionistic and classical propositional logics (with the full set of operators -- falsum, implication, conjunction and disjunctio…
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-…
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…
Insecurity problem for assertions remains in NP
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…