[Publicity-list] DIMACS Workshop on Security Analysis of Protocols
Registration Deadline May 28, 2004** * 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 ** 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
[Publicity-list] DIMACS Workshop on Security Analysis of Protocols
* 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 an
[Publicity-list] DIMACS Workshop on Security Analysis of Protocols
* 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. ** 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]
[Publicity-list] DIMACS Workshop on Security Analysis of Protocols
* 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, the logic approach aimed at developing (automated) tools for the formal veri.cation of protocols and the complexity theory 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. The goal of this workshop is to generally promote work on security analysis of protocols and foster cooperative research combining the logical and complexity-based approaches. The workshop will include tutorials on the basics of each approach and will allow representatives from both communities to talk about their current work. 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: The workshop will be open for the public. If you'd like to give a presentation please send a title and abstract to the organizers as soon as possible. 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. ** 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]
DIMACS Workshop on Security Analysis of Protocols
* DIMACS Workshop on Security Analysis of Protocols June 7 - 9, 2004 DIMACS Center, 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, the logic approach aimed at developing (automated) tools for the formal veri.cation of protocols and the complexity theory 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. The goal of this workshop is to generally promote work on security analysis of protocols and foster cooperative research combining the logical and complexity-based approaches. The workshop will include tutorials on the basics of each approach and will allow representatives from both communities to talk about their current work. 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: Interested participants may contact the organizers. ** Registration Fees: (Pre-registration deadline: May 28, 2004) Regular Rate Preregister before deadline $120/day After preregistration deadline $140/day Reduced Rate* Preregister before deadline $60/day After preregistration deadline $70/day Postdocs Preregister before deadline $10/day After preregistration deadline $15/day DIMACS Postdocs $0 Non-Local Graduate & Undergraduate students Preregister before deadline $5/day After preregistration deadline $10/day Local Graduate & Undergraduate students $0 (Rutgers & Princeton) DIMACS partner institution employees** $0 DIMACS long-term visitors*** $0 Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee during the course of the workshop. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). * College/University faculty and employees of nonprofit and government organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at [EMAIL PROTECTED] Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the pre-registration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, AT&T Labs - Research, Bell Labs, NEC Laboratories America and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, IBM Research and Microsoft Research are also waived. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. * 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]