*************************************************
      
 DIMACS Workshop on Security Analysis of Protocols
          
 June 7 - 9, 2004
 DIMACS Center, CoRE Building, Rutgers University, Piscataway, NJ

Organizers: 

  John Mitchell, Stanford, [EMAIL PROTECTED] 
  Ran Canetti, IBM Watson, [EMAIL PROTECTED] 
   
Presented under the auspices of the Special Focus on Communication
Security and Information Privacy.

    ************************************************ 

The analysis of cryptographic protocols is a fundamental and
challenging area of network security research. Traditionally, there
have been two main approaches. One is the logic approach aimed at
developing automated tools for the formal verification of
protocols. The other is the computational or complexity-theoretic
approach that characterizes protocol security as a set of
computational tasks and proves protocol security via reduction to the
strength of the underlying cryptographic functions. Although these two
lines of work share a common goal, there has been little commonality
between them until the last year or two.

The goal of this workshop is to promote work on security analysis of
protocols and provide a forum for cooperative research combining the
logical and complexity-based approaches.

The workshop will include tutorials on the basics of each approach and
will allow researchers from both communities to talk about their
current work.

Several tutorials and a number of research talks have already been
selected. However, some additional program slots have been set aside
for late-breaking Contributions from interested participants. If you
are interested in giving a talk, please send a title and short
abstract (1-3 pages) to the organizers, Ran Canetti and John Mitchell,
with subject heading "DIMACS Security Protocols - title and abstract,"
by May 15, 2004.

TOPICS

    * - Analysis methods involving computational complexity
    * - Game-theoretic approaches
    * - Methods based on logic and symbolic computation
    * - Probabilistic methods
    * - Model checking and symbolic search
    * - Formal proof systems
    * - Decision procedures and lower bounds
* - Anything else that sounds like a great idea 

**************************************************************
Participation:

Several tutorials and a number of research talks have already been
selected. However, some additional program slots have been set aside
for late-breaking Contributions from interested participants. If you
are interested in giving a talk, please send a title and short
abstract (1-3 pages) to the organizers, Ran Canetti and John Mitchell,
with subject heading "DIMACS Security Protocols - title and abstract,"
by May 15, 2004.

The workshop will be open to the public. If you'd like to give a
presentation, please send a title and abstract to the organizers by
May 15, 2004. Also, we intend this to be a participatory and
interactive meeting so we hope you will be able to contribute to the
meeting even without giving an announced talk. 

**************************************************************

Workshop Program:

Monday, June 7, 2004
 
 8:30 -  9:00  Breakfast and Registration - 4th Floor CoRE Bldg.

 9:00 -  9:10  Welcome and Opening Remarks
               Fred Roberts, DIMACS Director

 9:10 -  9:30  Welcome 
               John Mitchell, Stanford University
               Ran Canetti, IBM Watson

 9:30 - 10:30  Tutorial: Formal methods and protocol analysis
               Peter Ryan, University of Newcastle Upon Tyne

10:30 - 11:00  Break

11:00 - 12:30  Session    
 
               Modeling security protocols using I/O automata
               Nancy Lynch, MIT

               Automata-based analysis of recursive cryptographic protocols
               Thomas Wilke, Kiel University

               Formal Analysis of Availability
               Carl A. Gunter, UPenn

12:30 -  2:00  Lunch

 2:00 -  3:00  Tutorial: Towards cryptographically sound formal analysis
               Daniele Micciancio, UCSD 

 3:00 -  3:30  Break

 3:30 -  5:00  Session  

               A Reactively Secure Dolev-Yao-style Cryptographic Library
               Birgit Pfitzmann, IBM Research

               Automated Computationally Faithful Verification of Cryptoprotocols:
               Applying and Extending the Abadi-Rogaway-Jürjens Approach
               Jan Jerjens, TU Munich

               Universally Composable Symbolic Analysis of Cryptographic Protocols
               Jonathan Herzog, MIT

 5:00          Reception - Wine and cheese - DIMACS Lounge

Tuesday, June 8, 2004

 8:30 -  9:00  Breakfast and Registration - 4th Floor CoRE Bldg.
 
 9:30 - 10:30  Tutorial: On composability of cryptographic protocols   
               Yehuda Lindell, IBM Research

10:30 - 11:00  Break

11:00 - 12:30  Session   

               New Notions of Security: Achieving Universal Composability 
               without Trusted Setup
               Manoj Prabhakaran and Amit Sahai, Princeton U

               Universal Composability With Priced Ideal Protocols
               Dominic Mayers, CalTech

               A probabilistic polynomial-time calculus for the analysis of
               cryptographic protocols
               Andre Scedrov, UPenn

12:30 -  2:00  Lunch

 2:00 -  3:00  Tutorial: Proving protocol properties      
               Joshua D. Guttman, MITRE

 3:00 -  3:30  Break

 3:30 -  5:30  Session     

               Machine-Checked Formalization of the Generic Model and the Random 
Oracle Model
               Sabrina Tarento, INRIA

               A Framework for Security Analysis with Team Automata
               M. Petrocchi, IIT-CNR

               Sequential Process Calculus and Machine Models for Simulation-based 
Security
               Ralf Kuesters, TU Dresden

               Computational and Information-Theoretic Soundness 
               and Completeness of the Expanded Logics of Formal Encryption
               Gergely Bana, UPenn

 5:30          End of Session

 7:30          Banquet Dinner  (location TBA)
      
Wednesday, June 9, 2004 

 8:30 -  9:00  Breakfast and Registration - 4th Floor CoRE Bldg.
 
 9:30 - 10:30  Tutorial: Formal representions of polynomial-time 
               algorithms and security
               Bruce Kapron, U. of Victoria

10:30 - 11:00  Break

11:00 - 12:30  Session    

               Collusion-Free Protocols
               Silvio Micali, MIT

               A Framework for Fair (Multi-Party) Computation
               Juan Garay, Bell Labs

               Dolev-Yao-type Abstraction of Modular Exponentiation - the Cliques Case 
Study
               Olivier Pereira and Jean-Jacques Quisquater, UCL

12:30 -  1:30  Lunch

 1:30  - 2:30  Tutorial: Constraint-based methods: 
               Adding computational properties to symbolic models
               Vitaly Shmatikov, SRI

 2:30 -  2:45  Break

 2:45 -  4:45  Session  

               Towards a Hierarchy of Cryptographic Protocol Model
               Cathy Meadows, NRL

               Message Equivalent and Imperfect Cryptography in a Formal Model
               Angelo Trolina, U Pisa

               Sound Approximations to Diffie-Hellman Using Rewrite Rules
               Christopher Lynch,  Clarkson U.

               Fine-Grained MSR Specifications for Quantitative Security Analysis
               Iliano Cervesato, NRL

 4:45          End of Workshop

***********************************************************************
Registration Fees:

(Pre-registration deadline: May 28, 2004)

Please see website for information on registration.

*********************************************************************
Information on participation, registration, accomodations, and travel 
can be found at:

http://dimacs.rutgers.edu/Workshops/Protocols/

   **PLEASE BE SURE TO PRE-REGISTER EARLY**

********************************************************************

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]

Reply via email to