Workshop on Formal and Computational Cryptography
FCC 2008

June 26, 2008, Carnegie Mellon University, Pittsburgh, PA, USA
Steinberg Auditorium, Baker Hall A53

The 4th Workshop on Formal and Computational Cryptography is affiliated with CSF 2008 and will be co-located with CSF 2008 and LICS 2008. It will be held in Carnegie Mellon University, Pittsburgh, PA, USA on June 26, 2008.

NEW: There will be a workshop dinner on June 25, 7:30pm, at Schenley Park Visitor Center, at the intersection of Frank Curto Dr, Schenley Dr, and Panther Hollow Road (on the left of the Phipps Conservatory).

NEW: We are proud to announce that Gilles Barthe will be invited speaker of FCC'08.

Background, aim and scope

Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches is based on a computational model that considers issues of computational complexity and probability. Messages are modeled as bitstrings and security properties are defined in a strong form, in essence guaranteeing security with high probability against all probabilistic polynomial-time attacks. However, it is difficult to prove security of large, complex protocols in this model. The other approach relies on a symbolic model of protocol execution in which messages are modeled using a term algebra and cryptographic primitives are treated as perfect black-boxes, e.g. the only way to decrypt a ciphertext is to use the corresponding decryption key. This abstraction enables significantly simpler and often automated analysis of complex protocols. Since this model places strong constraints on the attacker, a fundamental question is whether such an analysis implies the strong security properties defined in the computational model.

This workshop focuses on approaches that combine and relate symbolic and computational protocol analysis. Over the last few years, there has been a spate of research results in this area. One set of results establish correspondence theorems between the two models, in effect showing that for a certain class of protocols and properties, security in the symbolic model implies security in the computational model. In other work, researchers use language-based techniques such as process calculi and protocol logics to reason directly about the computational model. Several projects are investigating ways of mechanizing computationally sound proofs of protocols. The workshop seeks results in this area of computationally sound protocol analysis: foundations and tools.

Important dates

  • Deadline for submission: May 12, 2008 (extended)
  • Notification of acceptance/rejection: May 26, 2008
  • Final abstract due: June 6, 2008
  • Workshop: June 26, 2008

For further information please contact the program chairs: fcc2008 AT di DOT ens DOT fr

Page maintained by Bruno Blanchet.  Last modified on January 01, 1970.