and call for full papers and for informal contributions
about catastrophic events related to cryptography
and security. And their prevention, detection,
recovery, solutions ...
The main point is: many cryptographic protocols
are only based on the security of one
cryptographic algorithm (e.g. RSA) and we
don't know the exact RSA security (including Ron
Rivest). What if somebody finds a clever and
fast factoring algorithm? Well, it is indeed an
hypothesis but we know several instances of
possible progress. A new fast algorithm is a
possible catastroph if not handled
properly. And there are other problems with hash
functions, elliptic curves, aso. Think also about
the recent Heartbleed bug (April 2014, see http://en.wikipedia.org/wiki/Heartbleed): the discovery was very late and
we were close to a catastrophic situation.
So we are thinking about a regular workshop, the
name is CATACRYPT, about these possible problems
and their solutions. It includes problems with
cryptographic algorithms, protocols, PKI, DRM,
TLS-SSL, smart cards, RSA dongles, MIFARE, aso. Quantum
computing, resilience and agility are also on the
The workshop aims at bringing together researchers
and practitioners working in cryptography and
security, from academia and industry. A large
committee including many founders of the main
concepts of public-key cryptography is pushing
this important topic.
workshop will consist of invited keynote
presentations, full papers, informal
rump session and discussions. There will be IEEE
formal proceedings only for full papers. This possibility is open for
the invited talks.
Martin E. Hellman (Professor Emeritus of Electrical Engineering, Stanford University)Final panel
Prolonging the Life of Public Key Cryptography
This talk argues
that prudence would require public key cryptography to use much larger
key sizes than are typically used. It also shows how seemingly
unforeseen advances in factoring and discrete logs might be forseeable.
It then examines what we might do to ensure a higher level of security,
and why barriers to achieving more robust security may be more
psychological than technical.
Nancy Leveson (MIT)
Protecting Against Broken Cryptography through Systems Thinking
Peter G. Neumann (SRI, comp.risks) and others
Risks of CataCryptic Event
Important Key Dates for submissions
All full papers will be submitted via EDAS. The authors
need to follow the formatting guidelines of IEEE CNS regular papers
available on the main conference website IEEE Conference on Communications and Network Security (CNS2014) http://cns2014.ieee-cns.org/content/submission-instructions-1 See also .
Informal contributions are also welcome any time before October 1st, 2014.
|full papers (IEEE)
| informal contributions
|| June 26, 2014 (updated)|
| any time before October 1st
|| July 5, 2014|
| two weeks after submission
Camera-ready version for full paper
| July 11, 2014|
| not applicable
|| October 29, 2014|
| October 29, 2014
workshop chair is Jean-Jacques Quisquater
(UCLouvain, Louvain-la-Neuve, Belgium)