CALL FOR PAPERS
--------------------

Workshop on Formal and Computational Cryptography
FCC 2007
July 4-5th 2007, Venice, Italy

http://www-verimag.imag.fr/~lakhnech/FCC/

Cryptographic protocols are small distributed programs that add security
services, like confidentiality or authentication, to network communication.
Since the 1980s, two approaches have been developed for analyzing security
protocols. One of the approaches relies on a computational model that considers
issues of complexity and probability. The other approach relies on a symbolic
model of protocol executions in which cryptographic primitives are black boxes.
The workshop focuses on the relation between the symbolic (Dolev-Yao) model and
the computational (complexity-theoretic) model. Recent results have shown that
in some cases the symbolic analysis is sound with respect to the computational
model. Recent results have shown that in some cases the symbolic analysis is
sound with respect to the computational model. A more direct approach which is
also investigated considers symbolic proofs in the computational model. The
workshop seeks results in any of these areas, and more generally, in the area of
system and program verification for security and cryptography. The workshop
seeks results in any of these areas.

Important dates

    * Deadline for submission: Monday, April 16 2007
    * Notification of acceptance/rejection: Wednesday, May 9 2007
    * Final version due: Monday, June 4 2007
    * Workshop: July 4-5 2007


-------------------------------------------------