S. P. Suresh

According to our database1, S. P. Suresh authored at least 23 papers between 2001 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2005
2010
2015
2020
0
1
2
3
4
1
1
1
1
1
1
2
1
2
2
2
1
1
1
1
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solving the Insecurity Problem for Assertions.
Proceedings of the 37th IEEE Computer Security Foundations Symposium, 2024

2022
Protocol Insecurity with Assertions.
CoRR, 2022

2021
Who holds the best card? Secure communication of optimal secret bits.
Australas. J Comb., 2021

2020
The complexity of disjunction in intuitionistic logic.
J. Log. Comput., 2020

Formalizing and Checking Multilevel Consistency.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Bounded Version Vectors Using Mazurkiewicz Traces.
Proceedings of the Advanced Computing and Systems for Security, 2020

2019
Dolev-Yao Theory with Associative Blindpair Operators.
Proceedings of the Implementation and Application of Automata, 2019

2017
Existential Assertions for Voting Protocols.
Proceedings of the Financial Cryptography and Data Security, 2017

Knowledge Transfer and Information Leakage in Protocols.
Proceedings of the Automated Technology for Verification and Analysis, 2017

2015
Bounded Implementations of Replicated Data Types.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2015

Effective Verification of Replicated Data Types Using Later Appearance Records (LAR).
Proceedings of the Automated Technology for Verification and Analysis, 2015

2014
Extending Dolev-Yao with Assertions.
Proceedings of the Information Systems Security - 10th International Conference, 2014

Optimized OR-Sets without Ordering Constraints.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013
Primal Infon Logic: Derivability in Polynomial Time.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2010
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
A Dolev-Yao Model for Zero Knowledge.
Proceedings of the Advances in Computer Science, 2009

2007
Knowledge-based modelling of voting protocols.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

2006
A (restricted) quantifier elimination for security protocols.
Theor. Comput. Sci., 2006

2005
Decidability of context-explicit security protocols.
J. Comput. Secur., 2005

Deciding knowledge properties of security protocols.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

Generic Verification of Security Protocols.
Proceedings of the Model Checking Software, 2005

2003
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2001
Information based reasoning about security protocols.
Proceedings of the Logical Aspects of Cryptographic Protocol Verification, 2001


  Loading...