Vitaly Shmatikov

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

Teaching   -   Publications   -   Program committees   -   Contact info   -   Some pictures

---

Teaching

CS 378 - Network Security and Privacy (Spring 2005)

CS 395T - Design and Analysis of Security Protocols (Fall 2004)

Security Analysis of Network Protocols (Stanford, Winter 2004)

---

Selected publications   (see in reverse chronological order)

Privacy

• S. Jarecki, V. Shmatikov. Probabilistic Escrow of Financial Transactions with Cumulative Threshold Disclosure. To appear in 9th International Conference on Financial Cryptography and Data Security, March 2005.   [abstract, PDF, PS]
• P. Lincoln, P. Porras, V. Shmatikov. Privacy-Preserving Sharing and Correlation of Security Alerts. 13th USENIX Security Symposium, pages 239-254, 2004.   [abstract, PDF, PS]
• S. Jarecki, V. Shmatikov. Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme. EUROCRYPT '04, vol. 3027 of LNCS, pages 590-608, 2004.   [abstract, PDF, PS]
• S. Jarecki, P. Lincoln, V. Shmatikov. Negotiated Privacy (extended abstract). International Symposium on Software Security (ISSS '02), vol. 2609 of LNCS, pages 96-111, 2003.   [abstract, PDF, PS]

Anonymity

• R. Dingledine, V. Shmatikov, P. Syverson. Synchronous Batching: From Cascades to Free Routes. To appear in 4th Workshop on Privacy Enhancing Technologies (PET), May 2004.   [abstract, PDF, PS]
• V. Shmatikov. Probabilistic Model Checking of an Anonymity System. Journal of Computer Security, special issue on selected papers of CSFW-15 (ed. S. Schneider), vol. 12(3/4), pages 355-377, 2004.   [abstract, PDF, PS]
  This paper supercedes:
  • V. Shmatikov. Probabilistic Analysis of Anonymity. 15th IEEE Computer Security Foundations Workshop (CSFW), 2002.
• D. Hughes, V. Shmatikov. Information Hiding, Anonymity and Privacy: A Modular Approach. Journal of Computer Security, special issue on selected papers of WITS '02 (ed. J. Guttman), vol. 12(1), pages 3-36, 2004.   [abstract, PDF, PS]
  This paper was also presented at the 19th Annual Conference on Mathematical Foundations of Programming Semantics (MFPS), and supercedes:
  • V. Shmatikov, D. Hughes. Defining Anonymity and Privacy. Workshop on Issues in the Theory of Security (WITS), 2002.

Analysis of security protocols
    computationally sound:

• A. Datta, R. Küsters, J.C. Mitchell, A. Ramanathan, V. Shmatikov. Unifying Equivalence-Based Definitions of Protocol Security. Workshop on Issues in the Theory of Security (WITS), pages 189-204, 2004.   [abstract, PDF, PS]

    decidable infinite-state:

• V. Shmatikov. Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. 13th European Symposium on Programming (ESOP '04), vol. 2986 of LNCS, pages 355-369, 2004.   [abstract, PDF, PS]
• J. Millen, V. Shmatikov. Symbolic Protocol Analysis with an Abelian Group Operator or Diffie-Hellman Exponentiation. Accepted to Journal of Computer Security, special issue on selected papers of CSFW-16 (ed. R. Foccardi), 2004.   [abstract, PDF, PS]
  This paper supercedes:
  • J. Millen, V. Shmatikov. Symbolic Protocol Analysis with Products and Diffie-Hellman Exponentiation. 16th IEEE Computer Security Foundations Workshop (CSFW), 2003.
• H. Comon-Lundh, V. Shmatikov. Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. 18th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 271-280, 2003.   [abstract, PDF, PS]
• H. Comon, V. Shmatikov. Is It Possible to Decide Whether a Cryptographic Protocol Is Secure Or Not?. Journal of Telecommunications and Information Technology, special issue on Cryptographic protocol verification (ed. J. Goubault-Larrecq), vol. 4, pages 5-15, 2002.   [abstract, PDF, PS]
• J. Millen, V. Shmatikov. Constraint Solving for Bounded-Process Cryptographic Protocol Analysis. 8th ACM Conference on Computer and Communications Security (CCS), pages 166-175, 2001.   [abstract, PDF, PS]

    probabilistic:

• R. Dingledine, V. Shmatikov, P. Syverson. Synchronous Batching: From Cascades to Free Routes (see Anonymity).
• V. Shmatikov. Probabilistic Model Checking of an Anonymity System (see Anonymity).
• G. Norman, V. Shmatikov. Analysis of Probabilistic Contract Signing (see Fair Exchange).

    finite-state:

• V. Shmatikov, J.C. Mitchell. Finite-State Analysis of Two Contract Signing Protocols (see Fair Exchange).
  
• V. Shmatikov, U. Stern. Efficient Finite-State Analysis for Large Security Protocols. 11th IEEE Computer Security Foundations Workshop (CSFW), pages 106-115, 1998.   [abstract, PDF, PS]
• J.C. Mitchell, V. Shmatikov, U. Stern. Finite-State Analysis of SSL 3.0. 7th USENIX Security Symposium, pages 201-215, 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.

Fair exchange and contract signing

• G. Norman, V. Shmatikov. Analysis of Probabilistic Contract Signing. Invited submission to Formal Aspects of Computing, special issue on selected papers of FASec '02 (eds. A. Abdallah, P. Ryan, and S. Schneider), 2005.   [abstract, PDF, PS]
  This paper supercedes:
  • G. Norman, V. Shmatikov. Analysis of Probabilistic Contract Signing. First International Conference on Formal Aspects of Security (FASec '02), vol. 2629 of LNCS, 2003.
• R. Chadha, J.C. Mitchell, A. Scedrov, V. Shmatikov. Contract Signing, Optimism, and Advantage. 14th International Conference on Concurrency Theory (CONCUR), vol. 2761 of LNCS, pages 366-382, 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). Accepted to Journal of Logic and Algebraic Programming, special issue on Processes and Security (ed. R. Amadio), 2004.
• V. Shmatikov, J.C. Mitchell. Finite-State Analysis of Two Contract Signing Protocols. Theoretical Computer Science (TCS), special issue on Theoretical Foundations of Security Analysis and Design (ed. R. Gorrieri), vol. 283(2), pages 419-450, 2002.   [abstract, PDF, PS]
  This paper supercedes the following three papers:
  • V. Shmatikov, J.C. Mitchell. Analysis of Abuse-Free Contract Signing. 4th International Conference on Financial Cryptography (FC '00), vol. 1962 of LNCS, 2001.
  • V. Shmatikov, J.C. Mitchell. Analysis of a Fair Exchange Protocol. 7th Annual ISOC Network and Distributed System Security Symposium (NDSS), 2000.
  • V. Shmatikov, J.C. Mitchell. Analysis of a Fair Exchange Protocol. In FLOC Workshop on Formal Methods and Security Protocols (FMSP), 1999.

Trust management

• V. Shmatikov, C. Talcott. Reputation-Based Trust Management. Accepted to Journal of Computer Security, special issue on selected papers of WITS '03 (ed. R. Gorrieri), 2004.   [abstract, PDF, PS]
  This paper supercedes:
  • V. Shmatikov, C. Talcott. Reputation-Based Trust Management (extended abstract). Workshop on Issues in the Theory of Security (WITS), 2003.

Foundations of programming languages

• V. Bono, A. Patel, V. Shmatikov. A Core Calculus of Classes and Mixins. 13th European Conference on Object-Oriented Programming (ECOOP), vol. 1628 of LNCS, pages 43-66, 1999.   [abstract, PDF, PS]
  
• V. Bono, A. Patel, V. Shmatikov, J.C. Mitchell. A Core Calculus of Classes and Objects. 15th Annual Conference on Mathematical Foundations of Programming Semantics (MFPS), vol. 20 of ENTCS, pages 43-64, 1999.   [abstract, PDF, PS]
  

---

Program committees

SAC 2005 (Security Track)     March 13-17, 2005, Santa Fe, New Mexico
CSFW 2005     June 20-22, 2005, Aix-en-Provence, France
FCS 2005 (affiliated with LICS)     June 30-July 1, 2005, Chicago, Illinois     (Deadline: March 18, 2005)
CCS 2005     November 7-11, 2005, Alexandria, Virginia     (Deadline: May 8, 2005)

Old events: LICS '04, TCS '04, I-NetSec '04 and '03, FCS '04 and '03 (affiliated with LICS), PORTIA Workshop on Sensitive Data in Medical, Financial, and Content-Distribution Systems (co-chair), SAC Security Track '04, Financial Crypto '04

---

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"