Vitaly Shmatikov
Ph.D. Stanford
Research interests:
computer security and privacy, formal methods for analysis of secure
systems and network protocols
Teaching -
Projects -
Papers -
Conferences -
UFC -
Contact -
Pictures
Teaching
Projects
Research papers
(see in reverse chronological order)
Password cracking
Network security
-
V. Shmatikov, M-H. Wang.
Secure Verification of Location Claims with
Simultaneous Distance Modification.
ASIAN 2007.
[abstract,
PDF,
PS]
- V. Shmatikov, M-H. Wang.
Security Against Probe-Response Attacks in Collaborative
Intrusion Detection.
LSAD 2007.
[abstract,
PDF,
PS]
- E. Wong, P. Balasubramanian, L. Alvisi, M. Gouda, V. Shmatikov.
Truth in Advertising: Lightweight Verification of Route Integrity.
PODC 2007.
[abstract]
- P. Gupta, V. Shmatikov.
Security Analysis of Voice-over-IP Protocols.
CSF 2007.
[abstract,
PDF,
PS]
- A. Mahimkar, J. Dange, V. Shmatikov, H. Vin, Y. Zhang.
dFence: Transparent Network-based Denial of Service Mitigation.
NSDI 2007.
[abstract,
PDF,
PS]
Privacy
-
J. Brickell, V. Shmatikov.
The Cost of Privacy: Destruction of Data-Mining Utility in
Anonymized Data Publishing.
KDD 2008.
[abstract]
-
A. Narayanan, V. Shmatikov.
Robust De-anonymization of Large Sparse Datasets
(How to Break Anonymity of the Netflix Prize Dataset).
S&P 2008.
[abstract,
PDF,
PS]
-
S. Jha, L. Kruger, and V. Shmatikov.
Towards Practical Privacy for Genomic Computation.
S&P 2008.
[abstract,
PDF,
PS]
-
J. Brickell, D. Porter, V. Shmatikov, E. Witchel.
Privacy-Preserving Remote Diagnostics.
CCS 2007.
[abstract,
PDF,
PS]
- S. Jarecki, V. Shmatikov.
Efficient Two-Party Secure Computation on Committed Inputs.
EUROCRYPT 2007.
[abstract]
- J. Brickell, V. Shmatikov.
Efficient Anonymity-Preserving Data Collection.
KDD 2006.
[abstract]
- P. Porras, V. Shmatikov.
Large-Scale Collection and Sanitization of Network Security Data: Risks
and Challenges.
NSPW 2006.
[abstract,
PDF,
PS]
- A. Narayanan, V. Shmatikov.
Obfuscated Databases and Group Privacy.
CCS 2005.
[abstract,
PDF,
PS]
-
J. Brickell, V. Shmatikov.
Privacy-Preserving Graph Algorithms in the Semi-Honest Model.
ASIACRYPT 2005.
[abstract,
PDF,
PS]
- S. Jarecki, V. Shmatikov.
Probabilistic Escrow of Financial Transactions with Cumulative
Threshold Disclosure.
Financial Crypto 2005.
[abstract,
PDF,
PS]
- P. Lincoln, P. Porras, V. Shmatikov.
Privacy-Preserving Sharing and Correlation of Security Alerts.
USENIX Security 2004.
[abstract,
PDF,
PS]
- S. Jarecki, V. Shmatikov.
Handcuffing Big Brother:
an Abuse-Resilient Transaction Escrow Scheme.
EUROCRYPT 2004.
[abstract,
PDF,
PS]
- D. Hughes, V. Shmatikov.
Information Hiding, Anonymity and Privacy: A Modular Approach.
J. Computer Security, 2004.
[abstract,
PDF,
PS]
This paper was also presented at MFPS 2003
and supercedes:
- V. Shmatikov, D. Hughes.
Defining Anonymity and Privacy.
WITS 2002.
- S. Jarecki, P. Lincoln, V. Shmatikov.
Negotiated Privacy.
ISSS 2002.
[abstract,
PDF,
PS]
Mix networks:
- V. Shmatikov, M-H. Wang.
Measuring Relationship Anonymity in Mix Networks.
WPES 2006.
[abstract,
PDF,
PS]
- V. Shmatikov, M-H. Wang.
Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses.
ESORICS 2006.
[abstract,
PDF,
PS]
- R. Dingledine, V. Shmatikov, P. Syverson.
Synchronous Batching: From Cascades to Free Routes.
PET 2004.
[abstract,
PDF,
PS]
Formal methods for security protocols
case studies:
computationally sound:
-
P. Gupta, V. Shmatikov.
Key Confirmation and Adaptive Corruptions in
the Protocol Security Logic. FCS-ARSPA 2006.
[abstract,
PDF,
PS,
full version]
-
P. Gupta, V. Shmatikov.
Towards Computationally Sound Symbolic Analysis of Key Exchange
Protocols. FMSE 2005.
[abstract,
PDF,
PS,
full version with proofs]
-
A. Datta, A. Derek, J.C. Mitchell, V. Shmatikov, M. Turuani.
Probabilistic Polynomial-Time Semantics for a Protocol Security
Logic.
ICALP 2005.
[abstract,
PDF,
PS]
- A. Datta, R. Küsters, J.C. Mitchell, A. Ramanathan, V. Shmatikov.
Unifying Equivalence-Based Definitions of Protocol Security.
WITS 2004.
[abstract,
PDF,
PS]
probabilistic:
game-based:
- A. Mahimkar, V. Shmatikov.
Game-Based Analysis of Denial-of-Service Prevention Protocols.
CSFW 2005.
[abstract,
PDF,
PS]
The paper in the CSFW proceedings contains a bug in the
verification conditions. This is the corrected version.
- R. Chadha, J.C. Mitchell, A. Scedrov, V. Shmatikov.
Contract Signing, Optimism, and Advantage.
CONCUR 2003.
[abstract,
PDF,
PS]
Revised journal version containing all proofs:
decidable infinite-state:
- J. Millen, V. Shmatikov.
Symbolic Protocol Analysis with an Abelian Group Operator or
Diffie-Hellman Exponentiation.
J. Computer Security, 2005.
[abstract,
PDF,
PS]
Warning:
Contains serious bugs in the proofs; corrections coming eventually.
This paper supercedes:
- J. Millen, V. Shmatikov.
Symbolic Protocol Analysis with Products and
Diffie-Hellman Exponentiation. CSFW 2003.
- V. Shmatikov.
Decidable Analysis of Cryptographic Protocols with
Products and Modular Exponentiation.
ESOP 2004.
[abstract,
PDF,
PS]
- H. Comon-Lundh, V. Shmatikov.
Intruder Deductions, Constraint Solving and Insecurity Decision
in Presence of Exclusive or.
LICS 2003.
[abstract,
PDF,
PS]
- H. Comon, V. Shmatikov.
Is It Possible to Decide Whether a Cryptographic Protocol
Is Secure Or Not?.
J. Telecommunications and Information Technology, 2002.
[abstract,
PDF,
PS]
- J. Millen, V. Shmatikov.
Constraint Solving for Bounded-Process Cryptographic
Protocol Analysis.
CCS 2001.
[abstract,
PDF,
PS]
finite-state:
- V. Shmatikov, J.C. Mitchell.
Finite-State Analysis of Two Contract Signing Protocols.
Theoretical Computer Science, 2002.
[abstract,
PDF,
PS]
This paper supercedes the following three papers:
- V. Shmatikov, J.C. Mitchell.
Analysis of Abuse-Free Contract Signing.
Financial Crypto 2000.
- V. Shmatikov, J.C. Mitchell.
Analysis of a Fair Exchange Protocol.
NDSS 2000.
- V. Shmatikov, J.C. Mitchell.
Analysis of a Fair Exchange Protocol.
FLOC Workshop on Formal Methods and Security Protocols, 1999.
- V. Shmatikov, U. Stern.
Efficient Finite-State Analysis for Large Security Protocols.
CSFW 1998.
[abstract,
PDF,
PS]
- J.C. Mitchell, V. Shmatikov, U. Stern.
Finite-State Analysis of SSL 3.0.
USENIX Security 1998.
[abstract,
PDF,
PS]
This paper supercedes:
- J.C. Mitchell, V. Shmatikov, U. Stern.
Finite-State Analysis of SSL 3.0 and Related Protocols.
DIMACS Workshop on Design and Formal Verification of
Security Protocols, 1997.
Trust management
Foundations of programming languages
Program committees
-
FAST 2008
Oct 9-10, 2008, Malaga, Spain
FMSE 2008 (PC chair)
Oct 27, 2008, Alexandria, VA
CCS 2008
Oct 27-31, 2008, Alexandria, VA
PKC 2009
Mar 18-20, 2009, Irvine, CA
S&P 2009
May 17-21, 2009, Oakland, CA
(deadline: November 10, 2008)
ICDCS 2009
Jun 22-26, 2009, Montreal, Canada
(deadline: November 15, 2008)
-
Contact information
-
- Department of Computer Sciences
The University of Texas at Austin
1 University Station C0500
Austin, TX 78712 U.S.A.
- email: first five letters of last name AT cs.utexas.edu
phone: +1-512-471-9530
office: TAY 4.115C
-
The face was drawn, the eyes haggard, the general appearance that of
one who has searched for the leak in life's gaspipe with a lighted
candle.
-- P.G.Wodehouse, "The Old Reliable"