CALL FOR CONTRIBUTIONS

                           8th Workshop on
                Formal and Computational Cryptography
                              (FCC 2012)


         Harvard University, Cambridge, Massachussets, USA
                           June 27th-28th 
                       affiliated with CSF'12

                  http://www.cs.bris.ac.uk/fcc12/

--- 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 complexity and probability. Messages
are modelled as bitstrings and security properties are defined in a
strong form, in essence guaranteeing security with high probability
against all 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 modelled 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 simpler and often automated analyses 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. Since the seminal work of Abadi
and Rogaway that opened this avenue of research, 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, types, and logics to reason directly about the
computational model. Several projects also investigate ways of
mechanizing computationally sound proofs of protocols.
The workshop seeks results in this area of computationally sound
protocol analysis: foundations and tools.

FCC'12 will be held in Cambridge, Massachussets at Harvard University
on June 27th and June 28th, immediately after CSF'12.  
We invite presentations of original results on the topics of the
workshop. We also encourage submissions that describe work in progress
or that further publicise interesting results published elsewhere. 
The main goal of the workshop is to stimulate discussions and new
collaborations.

--- Important dates --------------------

    * Deadline for abstract submission: April 20th, 2012 (extended)  
    * Author notification: May 11th, 2012
    * Final abstract due: May 25th,  2012
    * Workshop: June 27th-28th, 2012

--- Program committee ------------------

    * Bruno Blanchet (INRIA - ENS - CNRS, France)
    * Hubert Comon-Lundh (CNRS - ENS Cachan, France)
    * Veronique Cortier (CNRS - LORIA, France)
    * Anupam Datta (Carnegie Melon University, USA)
    * Bruce Kapron (University of Victoria, Canada)
    * Ralf Kuesters (University of Trier, Germany)
    * Dominique Unruh (University of Tartu, Estonia)
    * Bogdan Warinschi (University of Bristol, UK)
    * Santiago Zanella (Microsoft Cambridge, UK)

--- Submission Instructions ------------

The authors should submit a title and a short abstract of their talk
(about 100 to 200 words, maximum 1 page) that will be peer-reviewed by
our program committee. The workshop does not have formal proceedings,
but copies of the abstracts will be handed out to the participants of
the workshop. Workshop registration is open.

For information on how to submit your abstract, see
http://www.cs.bris.ac.uk/fcc2012/

For further information please contact the program chair 
Bogdan Warinschi, bogdan@cs.bris.ac.uk