Information assurance - Network security, Cryptography, Security programming.
Computer Science - Data structures, Algorithm analysis, OOP, Discrete Math, Internet Programming.
Research Interests:
Information assurance, Network security, Formal methods for analysis of
secure systems, Cryptographic protocols.
Web interfaces to popular research tools:
Click here for web site and demo to
ProVerif tool for automatic cryptographic protocol verification.
Click here for web site and demo to
Maude-NPA tool for cryptographic protocol analysis.
Click here for
web site and demo to Constraint Solver
tool for cryptographic protocol analysis.
Selected Publications:
S. Malladi, P. Lafourcade.
How to prevent type-flaw attacks on security protocols under algebraic properties, In Proc.
Workshop on Security and Rewriting Techniques (affiliated to CSF Symposium),
Port Jefferson, NY, July 2009. Download | BibTex
S. Malladi, B. Bruhadeshwar, K. Kothapalli.
Automatic analysis of distance bounding protocols. In Proc.
Workshop on Foundations of Computer Security (affiliated to LICS Symposium),
Los Angeles, CA,
August 2009. Download | BibTex
S. Malladi, G. S. Hura.What is the best way to prove a cryptographic protocol correct? (Position paper) In
Proc. Workshop on Security in Systems and Networks (affiliated to IPDPS),
Miami, Florida, April 2008. pdf | BibTex
S. Malladi, O. El-Gayar, K. Streff. Experiences and lessons learned in
the design and implementation of an Information Assurance curriculum. In Proc.
8th Annual IEEE SMC Information Assurance Workshop
(IAW 2007),
United States Military Academy, West Point, NY, June 2007.
pdf | BibTex
S. Malladi. Web site hacking project and Web security laboratory
exercises to exploit Server-side (command injection) and Client-side
scripting (XSS) vulnerabilities.Online instructor support material for
Computer Security: Principles and Practice by
William Stallings
and Lawrie Brown, Prentice Hall publishers, July
2007. pdf
S. Malladi, S. Rosenberg. Extending constraint solving for cryptographic protocol analysis
with non-standard attacker inference rules.In Proc.
International Conference
on Communication, Network and Information Security (CNIS 2005), Phoenix, AZ, Nov 2005.
pdf | BibTex
S. Malladi, Formal analysis and verification of
password protocols, PhD Dissertation (Subsumes papers below), 2004.
S. Malladi et al.How to prevent type-flaw guessing
attacks on password protocols. In Proc. Workshop on Foundations of
Computer Security (FCS03), Canada, June
2003. pdf | BibTex
R. Corin, S. Malladi et al. Guess what? Here is a new tool that
finds some new guessing attacks. In R. Gorrieri and R. Lucchi, editors,
IFIP WG 1.7 and ACM SIGPLAN, Workshop in the Issues of Theory of Security (WITS 03)
, Warsaw,
April 2003. pdf,
ps An extended
abstract | BibTex
S. Malladi et al. What are multi-protocol guessing attacks and how to
prevent them. In Proc. 11th IEEE International Workshops on Enabling Technologies:
Infrastructure for Collaborative Enterprises, Enterprise Security, (WETICE 2002),
IEEE Computer Society, June 2002, Pittsburgh, PA. ISBN 0-7695-1748-X.
(BEST Paper award). Note: The problem presented in this paper was solved by Delaune, Kremer, Ryan in "Secure composition of password protocols" published in CSF 2008.
BibTex
S. Malladi, P. Lafourcade.
How to prevent type-flaw attacks on security protocols under algebraic properties, In Proc.
Workshop on Security and Rewriting Techniques (affiliated to CSF Symposium),
Port Jefferson, NY, July 2009. Download | BibTex