Vitaly Shmatikov

Research interests: computer security and privacy, formal methods for analysis of secure systems and network protocols

Teaching   -   Projects   -   Papers   -   Conferences   -   Contact info   -   Some pictures

---

Teaching

• CS 378 - Network Security and Privacy (Fall 2007, Spring 2007, 2006, 2005)
• CS 380S - Theory and Practice of Secure Systems (Fall 2006, 2005)
• CS 395T - Design and Analysis of Security Protocols (Fall 2004)
• Security Analysis of Network Protocols (Stanford, Winter 2004)

---

Projects

• New Privacy Frameworks for Collaborative Information Sharing   (NSF IIS)
• High-Fidelity Methods for Security Protocols   (NSF CNS)
• Cyber-Threat Analytics   (ARO)
• Autonomic Systems: Integrating Machine Learning with Computer Systems   (NSF CNS)

---

Selected papers   (see in reverse chronological order)

Password cracking

• A. Narayanan, V. Shmatikov. Fast Dictionary Attacks on Passwords Using Time-Space Tradeoff. CCS 2005.   [abstract, PDF, PS]

Network security

• E. Wong, P. Balasubramanian, L. Alvisi, M. Gouda, V. Shmatikov. Truth in Advertising: Lightweight Verification of Route Integrity. PODC 2007 (coming soon!).
• 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

• S. Jarecki, V. Shmatikov. Efficient Two-Party Secure Computation on Committed Inputs. EUROCRYPT 2007.   [abstract]
• A. Narayanan, V. Shmatikov. How To Break Anonymity of the Netflix Prize Dataset.   [abstract]
  
  • Read the New Scientist article about our Netflix work.
• 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
    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:

• G. Norman, V. Shmatikov. Analysis of Probabilistic Contract Signing. J. Computer Security, 2006.   [abstract, PDF, PS]
  This paper supercedes:
  • G. Norman, V. Shmatikov. Analysis of Probabilistic Contract Signing. FASec 2002.
• V. Shmatikov. Probabilistic Model Checking of an Anonymity System. J. Computer Security, 2004.   [abstract, PDF, PS]
  This paper supercedes:
  • V. Shmatikov. Probabilistic Analysis of Anonymity. CSFW 2002.

    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:
  • R. Chadha, J.C. Mitchell, A. Scedrov, V. Shmatikov. Contract Signing, Optimism, and Advantage (with proofs). J. Logic and Algebraic Programming, 2005.

    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

• V. Shmatikov, C. Talcott. Reputation-Based Trust Management. J. Computer Security, 2005.   [abstract, PDF, PS]
  This paper supercedes:
  • V. Shmatikov, C. Talcott. Reputation-Based Trust Management. WITS 2003.

Foundations of programming languages

• V. Bono, A. Patel, V. Shmatikov. A Core Calculus of Classes and Mixins. ECOOP 1999.   [abstract, PDF, PS]
  
• V. Bono, A. Patel, V. Shmatikov, J.C. Mitchell. A Core Calculus of Classes and Objects. MFPS 1999.   [abstract, PDF, PS]
  

---

Program committees

ACNS 2007     Jun 5-8, 2007, Zhuhai, China
PET 2007     Jun 20-22, 2007, Ottawa, Canada
CSF 2007     July 6-8, 2007, Venice, Italy
Inscrypt 2007     Aug 31 - Sep 5, 2007, Xining, China
QEST 2007     Sep 16-19, 2007, Edinburgh, Scotland
ESORICS 2007     Sep 24-26, 2007, Dresden, Germany
WPES 2007     Oct 29, 2007, Alexandria, VA       (deadline: June 10, 2007)
CCS 2007     Oct 29 - Nov 2, 2007, Alexandria, VA
FMSE 2007     Nov 2, 2007, Fairfax, VA       (deadline: June 10, 2007)
ASIAN 2007     Dec 9-11, 2007, Doha, Qatar       (deadline: July 27 / August 3, 2007)
Formal Methods 2008     May 26-30, 2008, Turku, Finland

---

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"