IACR News
Here you can see all recent updates to the IACR webpage. These updates are also available:
23 December 2016
Bucharest, Romania, 18 September - 20 September 2017
Event CalendarSubmission deadline: 31 May 2017
Notification: 25 June 2017
Saint-Petersburg, Russia, 6 April - 7 April 2017
Event CalendarSubmission deadline: 27 February 2017
Ruhr University Bochum
Job PostingThe available positions are fully funded for three years.
The focus of the project is on practical as well as theoretical side-channel analysis of cryptographic devices. Applicants are required to have completed (or be close to completing) a Master (or an equivalent) with excellent grades in Computer/Electrical Engineering, Computer Science, Cryptography, or closely related areas. In addition to the usual computer and electrical engineering background, the candidate is expected to be able to deal with either hardware designs (e.g., VHDL/verilog) or software designs (e.g., ARM processors) which is essential for the project.
Please send your application via e-mail as a single pdf containing a CV, copies of transcripts and certificates, and (if possible) names of references. Review of the applications will start immediately until the position has been filled. Note that only short-listed candidates will be notified.
Send your applications to emsec+apply (at) rub (dot) de
Starting date: earliest possible
Founded in 2001, the Horst Goertz Institute at Ruhr-University Bochum is a leading interdisciplinary research center dedicated to research and education covering all aspects of IT security, with an excellent record of research in cryptography. The Horst Goertz Institute has more than 15 professors and over 80 PhD students.
Closing date for applications: 31 March 2017
Contact: Amir Moradi
More information: https://www.emsec.rub.de
21 December 2016
Eric R. Verheul
ePrint ReportErdem Alkim, Léo Ducas, Thomas Pöppelmann, Peter Schwabe
ePrint ReportThe price for that simplicity is small: one of the exchanged messages increases in size by $6.25%$ from $2048$ bytes to $2176$ bytes. The security of NewHopeLP is the same as the security of NewHope; the performance is very similar.
Pablo Lamela Seijas, Simon Thompson, Darryl McAdams
ePrint ReportMathias Wagner, Yongbo Hu, Chen Zhang, Yeyang Zheng
ePrint ReportSteven D. Galbraith, Christophe Petit, Javier Silva
ePrint ReportMomonari Kudo
ePrint ReportDebapriya Basu Roy, Shivam Bhasin, Sikhar Patranabis, Debdeep Mukhopadhyay
ePrint ReportMike Scott
ePrint ReportRio LaVigne
ePrint ReportIn this work, we build upon the results from CHT and Joye. We take the simple intuition from CHT, that ciphertexts can be seen as polynomials, but also demonstrate that we only need to send as much data as in the original Cocks scheme. This perspective leads to better intuition as to why these ciphertexts are homomorphic and to explicit efficient algorithms for computing this homomorphic addition.
We believe that our approach will facilitate other extensions of Cocks IBE. As an example, we exhibit a two-way proxy re-encryption algorithm, which arises as a simple consequence of the structure we propose. That is, given a re-encryption key, we can securely convert a ciphertext under one key to a ciphertext under the other key and vice-versa (hence two-way).
Krishna Bagadia, Urbi Chatterjee, Debapriya Basu Roy, Debdeep Mukhopadhyay, Rajat Subhra Chakraborty
ePrint ReportFrank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, Matei Zaharia
ePrint ReportNasrollah Pakniat, Mahnaz Noroozi
ePrint ReportZengpeng Li, Steven D. Galbraith, Chunguang Ma
ePrint ReportThe main contribution of this paper is to explore a new approach to achieving this goal, which does not rely on a notion of "valid ciphertexts". The idea is to generate a "one-time" private key every time the decryption algorithm is run, so that even if an attacker can learn some bits of the one-time private key from each decryption query, this does not allow them to compute a valid private key.
This is the full version of the paper. The short version, which appeared in Provsec 2016, presented a variant of the Gentry-Sahai-Waters (GSW) levelled homomorphic encryption scheme. Damien Stehle pointed out an attack on our variant of this scheme that had not been anticipated in the Provsec paper; we explain the attack in this full version. This version of the paper also contains a new "dual" version of the GSW scheme. We give an explanation of why the known attacks no longer break the system. It remains an open problem to develop a scheme for which one can prove IND-CCA1 security.
Merrielle Spain, Mayank Varia
ePrint Report20 December 2016
Taipei, Taiwan, 25 September - 28 September 2017
CHESSubmission deadline: 17 March 2017
Notification: 6 June 2017
University of Westminster, Department of Computer Science
Job PostingThis is a full-time, permanent post and the successful candidate will join a Department with a widely recognised reputation for teaching Computer Science in the heart of London. The Department hosts several well-established undergraduate and postgraduate courses for both full-time and part-time students.
The appointee will be expected to join an energetic and innovative team of academic staff who deliver undergraduate and postgraduate teaching. In collaboration with our current team in cyber security, the applicant will contribute to teaching in our postgraduate courses and embed cyber security in all levels of our undergraduate courses. The cyber security curriculum in our programmes was recently redesigned around the CISSP themes so they are kept aligned with (ICS)2 both in current state and in the way our modules get updated. Supervision of student projects forms an important component of our staff’s professional practice.
Staff are also encouraged to develop their external research profile and the appointee to this post will be expected to contribute to one or more of the Faculty of Science and Technology’s multidisciplinary Research Groups that include the Cyber Security research group, the Centre for Parallel Computing, Distributed and Intelligent Systems, Software Systems Engineering.
Job reference number: 50042930
Salary: £39,502– £43,870 per annum (incl. L.W.A.)
Interviews are likely to be held in the week commencing 27th February 2017
Closing date for applications: 3 February 2017
Contact: For an informal discussion on the post please contact: Dr Aleka Psarrou, Head of Department of Computer Science at psarroa (at) westminster.ac.uk or telephone 020 7911 4846.
More information: https://vacancies.westminster.ac.uk/Hrvacancies/default.aspx?id=50042930
16 December 2016
Melbourne, Australia, 29 November - 1 December 2017
Event CalendarSubmission deadline: 25 July 2017
Notification: 9 September 2017