IACR 2014 Election: Vote now!
IACR 2014 Election
The 2014 election is being held to fill three of nine IACR Director positions.
The 2014 Election for Directors of the IACR Board is now open. Eligible IACR members may vote now through November 15th using the Helios cryptographically-verifiable election system. You may vote as often as you wish, but only your last vote will be counted.
Eligible members of the IACR (generally people who attended an IACR conference or workshop in 2013) should have received voting credentials from email@example.com, sent to their email address of record with the IACR. Questions about this election may be sent to firstname.lastname@example.org.
More information about the candidates can be found at the IACR elections page.
- Bart Preneel (Chair)
- Michel Abdalla (Returning Officer)
- Anna Lysyanskaya
PhD Student, RMIT University, Melbourne, Australia
Recently, there has been increasing interest in the paradigm of data mining-as-a-service, where a company lacking of expertise of computation resources outsources its mining needs to the cloud. However, privacy concerns have become a major barrier to the widespread growth of data mining-as-a-service.
We offer one PhD scholarship to support a PhD student to work on a project which aims to explore practical privacy-preserving solutions for cloud data mining-as-a-service. The candidate is expected to submit a PhD thesis based on the research.
Candidates should have a Master degree in Computer Science, Knowledge of cryptographic protocols, data mining algorithms and cloud computing architecture. Publications in database security and privacy will be regarded as an additional merit.
Send your CV and publication record to xun.yi (at) rmit.edu.au.
Tweaks and Keys for Block Ciphers: the TWEAKEY Framework, by Jérémy Jean and Ivica Nikolić and Thomas Peyrin
We propose the TWEAKEY framework with goal to unify the design of tweakable block ciphers and of block ciphers resistant to related-key attacks. Our framework is simple, extends the key-alternating construction, and allows to build a primitive with arbitrary tweak and key sizes, given the public round permutation (for instance, the AES round). Increasing the sizes renders the security analysis very difficult and thus we identify a subclass of TWEAKEY, that we name STK, which solves the size issue by the use of finite field
multiplications on low hamming weight constants. We give very efficient instances of STK, in particular, a 128-bit tweak/key/state block cipher Deoxys-BC that is the first AES-based ad-hoc tweakable block cipher. At the same time, Deoxys-BC could be seen as a secure alternative to AES-256, which is known to be insecure in the related-key model. As another member of the TWEAKEY framework, we describe Kiasu-BC, which is a very simple and even more efficient tweakable variation of AES-128 when the tweak size is limited to 64 bits.
In addition to being efficient, our proposals, compared to the previous schemes that use AES as a black box, offer security beyond the birthday bound. Deoxys-BC and Kiasu-BC represent interesting pluggable primitives for authenticated encryption schemes, for instance, OCB instantiated with Kiasu-BC runs at about 0.75 c/B on Intel Haswell. Our work can also be seen as
advances on the topic of secure key schedule design for AES-like ciphers, describing several proposals in this direction.
Post Doc, Université de Caen Basse-Normandie
Applications are invited a post-doctoral position in pairing-based cryptography at Caen University. The successful applicant will participate in the project SIMPATIC (SIM and PAiring Theory for Information and Communications security) financed by the French governemental research funding agency ANR (Agence Nationale de la Recherche) and organized by Orange Labs, Caen. He/she will be a member of one of the research teams in the Computer Science (GREYC) or Mathematics (LMNO) laboratories at Caen University, France.
The position is open for one year. The starting date can be arranged as convenient, but in any case not later than 1st July 2015.
The partners involved in the SIMPATIC project are the crypto teams of the Laboratoire d\'Informatique de l\'ENS Paris, IMB (Bordeaux), University Paris 8, University Rennes 1, Oberthur, INVIA, STmicroelectronics (Le Mans) and Orange Labs (Caen).
The successful applicant will work on one of the following priorities of the project:
(i) The conception of cryptographic primitives suitable for SIMs and other small supports. Candidates are expected to have a high quality potential in theoretical cryptography. He/she will be expected to interact with members of the Applied Crypto Group (ACG) at Orange Labs (OL) in Caen.
(ii) The study of suitable pairing-friendly curves, both theoretical and algorithmic aspects. Candidates should therefore have a very strong background in relevant number theory and algebraic geometry. Some experience in software implementation (for example in Pari, Magma, Sage, ...) would be useful.
Preference will be given to candidates working on priority (i), but all applications related to the project themes will be examined.
Candidates must hold a PhD thesis or equivalent in mathematics or computer science, together with a strong research record.