Post-Doc, Commissariat à l\'Energie Atomique (French DoE), Paris area, France
Following recent advances in high throughput sequencing, it can be expected that, in the near future, more and more individuals will have their whole genome extracted, stored and analyzed in a routine fashion. Although this perspective is full of promises in terms of personalized preventive and curative medicine as well as medical research, it should also be acknowledged that the genome of an individual is in essence extremely sensitive data from (at least) a privacy standpoint. Thus, for such personalized medicine-oriented platforms to reliably exist, it is necessary to develop specific counter-measures providing intrinsic protection of the genomic data when manipulated by an IT infrastructure.
In this context, a very promising approach is grounded in homomorphic encryption as a means of computing directly over encrypted data.
The purpose of the present postdoctoral offer is thus to investigate the practical relevance of using homomorphic encryption techniques for privacy-preserving genetic data processing. The main use case will consist in performing requests on a database of genomes represented by their variants. Several scenarios will be investigated in particular with respect to the privacy of the request itself on top of the privacy of the genetic data. In this various scenarios, the candidate is expected to identify the most suitable homomorphic encryption techniques ranging from additive-only (e.g. suitable for private requests on unencrypted data) and multiplicative-only (e.g. suitable for disjunctive public requests on encrypted genetic data) homomorphic encryption systems to the use of the more recent (and more costly) fully homomorphic encryption techniques. The candidate will also be expected to build prototypes for one or more of the above scenarios in order to experimentally demonstrate the practical viability of the solutions, in particular with respect to performances.
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 firstname.lastname@example.org, sent to their email address of record with the IACR. Questions about this election may be sent to email@example.com.
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.