Workshop on Formal and Computational Cryptography
FCC 2006
July 9 2006, Venice, Italy
The
2nd Workshop on Formal and Computational Cryptography will be co-located with
ICALP 2006 and
CSFW 2006 which will be held in Venice, Italy in July 2006.
Background, aim and scope
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. This approach captures a strong notion of security,
guaranteed against all probabilistic polynomial-time attacks. However,
proofs in this model are difficult and less successful for large,
complex protocols. The other approach relies on a symbolic model of
protocol executions in which cryptographic primitives are treated as
black boxes. Since the seminal work of Dolev and Yao, it has been
realized that this latter approach enables significantly simpler and
often automated proofs of complex protocols. However, the guarantees
that it offers with respect to a deployed protocol have been quite
unclear.
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. A more direct approach which
is also investigated considers symbolic proofs in the computational
model. Papers proposing formal models sound for quantum security
protocols are also relevant. The workshop seeks results in any of
these areas.
Important dates
- Deadline for submission: April 16 2006
- Notification of acceptance/rejection: May 8 2006
- Final version due: June 4 2006
- Workshop: July 9 2006