Vitaly Shmatikov


Publications in reverse chronological order:

Get Off My Prefix! Using Gerontocratic Policies to Improve the Security and Stability of Internet Routing. UT Austin TR-09-15.

Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities. CSF 2009.

De-Anonymizing Social Networks. S&P 2009.

Privacy-Preserving Classifier Learning. Financial Crypto 2009.

The Cost of Privacy: Destruction of Data-Mining Utility in Anonymized Data Publishing. KDD 2008.

Robust De-Anonymization of Large Sparse Datasets. S&P 2008.

Towards Practical Privacy for Genomic Computation. S&P 2008.

Secure Verification of Location Claims with Simultaneous Distance Modification. ASIAN 2007.

Privacy-Preserving Remote Diagnostics. CCS 2007.

Truth in Advertising: Lightweight Verification of Route Integrity. PODC 2007.

Security Against Probe-Response Attacks in Collaborative Intrusion Detection. LSAD 2007.

Security Analysis of Voice-over-IP Protocols. CSF 2007.

Formal Analysis of Authentication in Bluetooth Device Pairing. FCS-ARSPA 2007.

Efficient Two-Party Secure Computation on Committed Inputs. EUROCRYPT 2007.

dFence: Transparent Network-based Denial of Service Mitigation. NSDI 2007.

Measuring Relationship Anonymity in Mix Networks. WPES 2006.

Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses. ESORICS 2006.

Large-Scale Collection and Sanitization of Network Security Data: Risks and Challenges. NSPW 2006.

Efficient Anonymity-Preserving Data Collection. KDD 2006.

Key Confirmation and Adaptive Corruptions in the Protocol Security Logic. FCS-ARSPA 2006.   (Full version with proofs)

Analysis of Probabilistic Contract Signing. J. Computer Security, 2006.

Privacy-Preserving Graph Algorithms in the Semi-Honest Model. ASIACRYPT 2005.

Fast Dictionary Attacks on Passwords Using Time-Space Tradeoff. CCS 2005.

Obfuscated Databases and Group Privacy. CCS 2005.

Towards Computationally Sound Symbolic Analysis of Key Exchange Protocols. FMSE 2005.   (Full version with proofs)

Probabilistic Polynomial-Time Semantics for a Protocol Security Logic. ICALP 2005.

Game-Based Analysis of Denial-of-Service Prevention Protocols. CSFW 2005.
The paper in the CSFW proceedings contains a bug in the verification conditions. This is the corrected version.

Probabilistic Escrow of Financial Transactions with Cumulative Threshold Disclosure. Financial Crypto 2005.

Symbolic Protocol Analysis with an Abelian Group Operator or Diffie-Hellman Exponentiation. J. Computer Security, 2005.
Warning: Contains serious bugs in the proofs; corrections coming eventually.

Contract Signing, Optimism, and Advantage. J. Logic and Algebraic Programming, 2005.

Reputation-Based Trust Management. J. Computer Security, 2005.

Privacy-Preserving Sharing and Correlation of Security Alerts. USENIX Security 2004.

Synchronous Batching: From Cascades to Free Routes. PET 2004.

Handcuffing Big Brother: An Abuse-Resilient Transaction Escrow Scheme. EUROCRYPT 2004.

Unifying Equivalence-Based Definitions of Protocol Security. WITS 2004.

Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. ESOP 2004.

Probabilistic Model Checking of an Anonymity System. J. Computer Security, 2004.

Information Hiding, Anonymity and Privacy: A Modular Approach. J. Computer Security, 2004 (also MFPS 2003).

Contract Signing, Optimism, and Advantage. CONCUR 2003.

Symbolic Protocol Analysis with Products and Diffie-Hellman Exponentiation. CSFW 2003.

Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. LICS 2003.

Reputation-Based Trust Management (extended abstract). WITS 2003.

Analysis of Probabilistic Contract Signing. FASec 2002.

Negotiated Privacy (extended abstract). ISSS 2002.

Probabilistic Analysis of Anonymity. CSFW 2002.

Defining Anonymity and Privacy. WITS 2002.

Finite-State Analysis of Two Contract Signing Protocols. Theoretical Computer Science, 2002.

Is It Possible to Decide Whether a Cryptographic Protocol Is Secure Or Not?. J. Telecommunications and Information Technology, 2002.

Constraint Solving for Bounded-Process Cryptographic Protocol Analysis. CCS 2001.

Analysis of Abuse-Free Contract Signing. Financial Crypto 2000.

Analysis of a Fair Exchange Protocol. NDSS 2000.

Analysis of a Fair Exchange Protocol. FLOC Workshop on Formal Methods and Security Protocols, 1999.

A Core Calculus of Classes and Mixins. ECOOP 1999.

A Core Calculus of Classes and Objects. MFPS 1999.

Efficient Finite-State Analysis for Large Security Protocols. CSFW 1998.

Finite-State Analysis of SSL 3.0. USENIX Security 1998.

Finite-State Analysis of SSL 3.0 and Related Protocols. DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997.