EXTENDED DEADLINE *** 25 May 2001 ***

Post-CAV Workshop on Logical Aspects of Cryptographic Protocol Verification

July 23, 2001
Paris, France
 

Invited Speakers | Submission Information | Dates | Chair | Program Committee

Aims and Scope

Security of computer systems is a growing field of concerns. While security in the large is quite a large and daunting field, the study of cryptographic protocols has received renewed interest in recent years, mostly because of the emergence of electronic commerce. The focus in cryptographic protocols, as opposed to mere cryptography, is the interaction of cryptographic primitives with message exchanges and possible malevolent actions from intruders. Most of the discovered bugs in cryptographic protocols are not so much tied to subtleties in cryptography, rather to logical aspects of interactions between principals.

From a protocol-oriented point of view, cryptographic protocols pose new challenges: there may be an unbounded number of principals (processes in parallel), state spaces are infinite even with bounded numbers of principals, and so on. Several models exist that handle the complexity of cryptographic protocol verification, based on process calculi, first-order logic, automata theory, complexity theory among others.

As such, cryptographic protocol verification is emerging as a research field in its own right, strongly linked to logic. It is the aim of this one-day workshop to bring together researchers in the field of cryptographic protocol verification to share new results in the field. Specific domains of interest are, among others:

A selection of accepted papers will be published in volume 55 of Electronic Notes in Theoretical Computer Science. The workshop will be held after CAV'01 in the same location (la Mutualité). CAV'01 follows FMICS'01 and SAS'01.

Invited Speakers

Accepted Papers

Scientific Program

9.00-10.00 Invited Talk 1 Y. Lakhnech -
10.00-10.30 R. Accorsi, D. Basin, L. Viganò Towards an awareness-based semantics for the analysis of security protocols
10.30-11.00 Break
11.00-11.30 Invited Talk 2 M. Rusinowitch The practice of cryptographic protocol verification
11.30-12.00 K. Adi, M. Debbabi Abstract interpretation for proving secrecy properties in security protocols
12.00-12.30 L. Carlucci Aiello, F. Massacci Attacking fair-exchange protocols: parallel models vs trace models
12.30-14.00 Lunch
14.00-15.00 Invited Talk 3 R. Amadio On the symbolic reduction of processes with cryptographic functions
15.00-15.30 P. Selinger Models for an adversary-centric protocol logic
15.30-16.00 R. Ramanujan, S. P. Suresh Information based reasoning about security protocols
16.00-17.00 Open Forum

Submission Information

(Submissions are closed.)

Submissions should be in PostScript format. The body of each submission should start with a short abstract and should be at most 10 pages long. The submission may include in addition an appendix containing technical details, which reviewers may read or not, at their discretion. The submission should contain the contact author's physical and e-mail addresses and phone number.

Submissions should be sent by email to goubault@lsv.ens-cachan.fr, with "LACPV Submission" clearly indicated in the title.

Dates

Submission deadline: May 15, 2001
Acceptance notification: June 15, 2001
Final version: July 01, 2001

Chair

Jean Goubault-Larrecq
LSV/UMR 8643,
ENS Cachan

Program Committee

The program committee will include at least:
Hubert Comon LSV, ENS Cachan
Mourad Debbabi Université Laval, Québec
Jon Millen Computer Science Lab, SRI International
Scott Stoller State University of New York, Stony Brook

Last modified on 19th March 2001 - cav01@lsv.ens-cachan.fr