CRYPTO registration open, Journal of Cryptology delivery changes
Registration for CRYPTO 2015 is now open (https://www.iacr.org/conferences/crypto2015/registration.html), which makes it a good time to let you know about a few important updates.
Paper delivery of the Journal of Cryptology is now *opt-in*. If you would like to receive hard-copy JoC editions, you must update your membership info. You can update proactively via the membership info form (https://secure.iacr.org/membership/members/update.html) or when paying your membership dues for 2016 during conference registration. If you have already paid your membership dues for 2016 you can still opt in and pay at a later time.
We have made some changes in how IACR membership records are stored internally. As a result, there is a small chance you will be asked to reset your password when authenticating. You will need access to the email address of record associated with your membership. If you experience problems, please contact the membership secretary at firstname.lastname@example.org.
Strong Security of the Strongly Multiplicative Ramp Secret Sharing based on Algebraic Curves, by Ryutaroh Matsumoto
We introduce a coding theoretic criterion for
Yamamoto\'s strong security
of the ramp secret sharing scheme.
After that, by using it, we show the strong security of
the strongly multiplicative
ramp secret sharing proposed by Chen et al. in 2008.
Diversity and Transparency for ECC, by Jean-Pierre Flori and Jérôme Plût and Jean-René Reinhard and Martin Ekerå
Generating and standardizing elliptic curves to use
them in a cryptographic context is a hard task.
In this note, we don\'t make an explicit proposal
for an elliptic curve, but we deal with the following
Security: We give a list of criteria that should be
satisfied by a secure elliptic curve. Although a few
of these criteria are incompatible, we detail what we
think are the best choices for optimal security.
Transparency: We sketch a way to generate a
curve in a fully transparent way so that it can be
trusted and not suspected to belong to a (not publicly
known to be) vulnerable class. In particular, since the
computational cost of verifying the output of such a
process may be quite high, we sketch out the format
of a certificate that eases the computations. We think
that this format might deserve being standardized.
A Hybrid Gaussian Sampler for Lattices over Rings, by Léo Ducas and Thomas Prest
Gaussian sampling over lattices is a cornerstone of lattice-based cryptography as it allows to build numerous cryptographic primitives. There are two main algorithms performing this task. The first one is due to Klein (SODA 2000) and Gentry, Peikert and Vaikuntanathan (STOC 2008), and outputs vectors of good quality but runs rather slowly, in quadratic time. The second one is due to Peikert (CRYPTO 2010) and outputs vectors of slightly worse quality, but can be made to run in quasilinear time in the ring setting.
We present a Gaussian Sampler optimized for lattices over the ring of integer of a cyclotomic number field. At a high-level it works as Klein\'s sampler but uses an efficient variant of Peikert\'s sampler as a subroutine. The result is a new sampler that samples vectors with a quality close to Klein\'s sampler and achieves the same quasilinear complexity as Peikert\'s sampler. In practice, we get close to the best of both worlds.
Cryptanalysis of a modern rotor machine in a multicast setting, by Shane Kepley and David Russo and Rainer Steinwandt
At FSE \'93, Anderson presented a modern byte-oriented ro-
tor machine that is suitable for fast software implementation. Building
on a combination of chosen ciphertexts and chosen plaintexts, we show
that in a setting with multiple recipients the recovery of an (equivalent) secret key can be feasible within minutes in a standard computer algebra system.
Two permanent academic posts in Secure Systems at Surrey, University of Surrey
The Department of Computer Science at the University of Surrey invites applications for two permanent posts of Lecturer (Assistant Professor) in Secure Systems.
The Department of Computer Science embodies the ethos of “applying theory into practice” across its research and teaching activities and is currently ranked 8th in the Guardian League table. Its research activities are focused into two research groups: Secure Systems, and Nature Inspired Computing and Engineering (NICE). These appointments are to enhance the activities of the Secure Systems group. Surrey is recognised as an Academic Centre of Excellence for Cyber Security Research by GCHQ. This is an exciting opportunity in a department that is growing its reputation for delivering quality interdisciplinary and applied research based on strong fundamental principles.
The candidates for the Lectureships will conduct research in areas such as security analysis of systems, cyber-physical and embedded systems security, data privacy or mobile security. We are seeking individuals who can contribute to fundamental research and turn it into practice. An ability to produce high quality outputs is also required.
We are looking for individuals who can inspire students through their curiosity for leading-edge aspects of technology. In particular, the teaching duties of the role includes: delivering high quality teaching to all levels of students, supervising undergraduate project students and postgraduate dissertations and contributing to the teaching of security and other practical areas of Computer Science, such as networking and software engineering.
These are full-time and permanent positions. We would expect appointed candidates to start from September 2015 or as soon as possible thereafter.