Workshop on Formal and Computational Cryptography
FCC 2013

June 30, 2013, Tulane University, New Orleans, Louisiana, USA


The 9th Workshop on Formal and Computational Cryptography is affiliated with CSF 2013 and will be co-located with CSF 2013 and LICS 2013. It will be held in Tulane University, New Orleans, Louisiana, USA on June 30, 2013.


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

  • Extended Deadline for submission: May 15th, 2013
  • Notification of acceptance/rejection: May 22nd, 2013
  • Final abstract due: June 6, 2013
  • Workshop: June 30, 2013




Page maintained by Hubert Comon-Lundh.  Last modified on April 02, 2013.        

Page maintained by Hubert Comon-Lundh.  Last modified on April 02, 2013.