International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) You can also receive updates via:

To receive your credentials via mail again, please click here.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

09:17 [Pub][ePrint] Masks will Fall Off -- Higher-Order Optimal Distinguishers, by Nicolas Bruneau and Sylvain Guilley and Annelie Heuser and Olivier Rioul

  Higher-order side-channel attacks are able to break the security of cryptographic implementations even if they are protected with masking countermeasures.

In this paper, we derive the best possible distinguishers

(High-Order Optimal Distinguishers or HOOD)

against masking schemes under the assumption that the attacker can profile.

Our exact derivation admits simple approximate expressions for high and low noise and shows to which extent the optimal distinguishers reduce to known attacks in the case where no profiling is possible.

From these results, we can explain theoretically the empirical outcome of recent works on second-order distinguishers.

In addition, we extend our analysis to any order and to the application to masked tables precomputation.

Our results give some insight on which distinguishers have to be considered in the security analysis of cryptographic devices.

09:17 [Pub][ePrint] An Optimization of Gu Map-1, by Yupu Hu and Huiwen Jia

  As a modified version of GGH map, Gu map-1 was successful in constructing multi-party key exchange (MPKE). In this short paper we present a result about the parameter setting of Gu map-1, therefore we can reduce a key parameter $\\tau$ from original $O(n^{2})$ down to $O(\\lambda n)$ (in theoretically secure case, where $\\lambda$ is the security parameter), and even down to $O(2n)$ (in computationally secure case). Such optimization greatly reduces the size of the map.

00:17 [Pub][ePrint] On Constructions of a Sort of MDS Block Diffusion Matrices for Block Ciphers and Hash Functions, by Ruoxin Zhao and Rui Zhang and Yongqiang Li and Baofeng Wu

  Many modern block ciphers use maximum distance separate

(MDS) matrices as their diffusion layers. In this paper, we propose

a new method to verify a sort of MDS diffusion block matrices whose

blocks are all polynomials in a certain primitive block over the

finite field $\\mathbb F_2$. And then we discover a new kind of

transformations that can retain MDS property of diffusion matrices

and generate a series of new MDS matrices from a given one.

Moreover, we get an equivalence relation from this kind of

transformation. And MDS property is an invariant with respect to

this equivalence relation which can greatly reduce the amount of

computation when we search for MDS matrices. The minimal polynomials

of matrices play an important role in our strategy. To avoid being

too theoretical, we list a series of MDS diffusion matrices obtained

from our method for some specific parameters. Furthermore, we

talk about MDS recursive diffusion layers with our method and extend

the corresponding work of M. Sajadieh et al. published on FSE 2012

and the work of S. Wu published on SAC 2012.

00:17 [Pub][ePrint] Adaptively Secure Computation with Partial Erasures, by Carmit Hazay and Yehuda Lindell and Arpita Patra

  Adaptive security is a strong corruption model that captures ``hacking\'\' attacks where an external attacker breaks into parties\' machines in the midst of a protocol execution. There are two types of adaptively-secure protocols: adaptive with erasures and adaptive without erasures. Achieving adaptivity without erasures is preferable, since secure erasures are not always trivial. However, it seems far harder.

We introduce a new model of adaptive security called adaptive security with partial erasures that allows erasures, but only assumes them in a minimal sense. Specifically, if all parties are corrupted then security holds as long as any single party successfully erases. In addition, security holds if any proper subset of the parties is corrupted without erasures.

We initiate a theoretical study of this new notion and demonstrate that secure computation in this setting is as efficient as static secure computation. In addition, we study the relations between semi-adaptive security~\\cite{GarayWZ09}, adaptive security with partial erasures, and adaptive security without any erasures. We prove that the existence of semi-adaptive OT implies secure computation in all these settings.

00:17 [Pub][ePrint] On the Systematic Constructions of Rotation Symmetric Bent Functions with Any Possible Algebraic Degrees, by Sihong Su and Xiaohu Tang

  In the literature, few constructions of $n$-variable rotation

symmetric bent functions have been presented, which either have

restriction on $n$ or have algebraic degree no more than $4$. In

this paper, for any even integer $n=2m\\ge2$, a first systemic

construction of $n$-variable rotation symmetric bent functions, with

any possible algebraic degrees ranging from $2$ to $m$, is proposed.

14:00 [News] A survey on the Helios e-voting system

  Dear IACR Member,

We are conducting a study on the verifiability aspects of e-voting and specifically the verifiability features of Helios, the system used in IACR elections. It will only take a couple of seconds to complete the survey.

The results and analysis of the survey will be made available to the community. The study is conducted by the U. of Athens Crypto.Sec group No personal information of any form is collected in this study.

IACR webmaster

17:24 [Conf][TCC] TCC 2016 CFP released

  The Thirteen Theory of Cryptography Conference will be held in Tel-Aviv, Israel, sponsored by the International Association for Cryptologic Research (IACR). Papers presenting original research on foundational and theoretical aspects of cryptography are sought.
  • Submission Deadline: 5:00 pm EDT July 13, 2015
  • Notification of Decision: October 2nd, 2015
  • Proceedings Version Due: October 26, 2015 (2PM EDT)
  • Conference: January 10-13, 2016
More details:

17:15 [Job][New] Professor in Cyber Security / Cyber Crime, Newcastle University, UK

  The School of Computing Science at Newcastle University has been awarded the status of Centre of Excellence in Cyber Security Research by GCHQ/EPSRC and is investing significantly in its research in cyber security and cybercrime. A lectureship position is associated with this professorial post and once a Professor has been appointed, we will work with them to appoint a lecturer in the field.

The research in cyber security in Newcastle has recently received significant research grants and has particular strengths in interdisciplinary and crime research. To continue building these research strengths, we are looking for an outstanding computer scientist with an excellent track record of research leadership in an area related to cyber security and cybercrime. This includes, computer security, computer and cyber forensics, cybercrime and human factors of security and privacy.

The School of Computing Science at Newcastle University is one of the strongest computer science Schools in the UK and in the 2014 REF was ranked 1st in the UK for the economic and social impact of its research. With an exciting, £58m development new building in Science Central and two centres for doctoral training, providing one hundred PhD students in the coming five years, including topics relevant to security, this is a great time to join the School.

17:15 [Job][New] Senior Engineer - Applied Cryptography, Centre for Secure Information Technologies (CSIT), Queen’s University Belfast, UK

  Applications are invited for Senior Engineer positions in Applied Cryptography within the Centre for Secure Information Technologies (CSIT), Queen’s University Belfast. CSIT is one of the UK’s lead Universities for cyber security research. It was awarded Academic Centre of Excellence in Cyber Security Research (ACE-CSR) status in 2012 by the UK’s GCHQ, in partnership with the Research Councils’ Global Uncertainties Programme (RCUK). There are currently 80 staff and researchers at CSIT, made up of academics, research assistants, engineers, PhD students and commercial staff. CSIT has a strong emphasis on internationally leading research with a focus on innovation and commercialisation. Stakeholders in CSIT include several major companies (Cisco, Thales, BAE Systems, Infosys, McAfee, IBM, Roke, Altera) and UK government agencies with a strong interest in this area. More details about CSIT are available on the website

Applicants must have at least a 2:1 Honours Degree (or equivalent) in Electrical and Electronics Engineering, Computer Science, Mathematics or closely related discipline. Applicants must have significant R&D or industrial experience in data security/cryptography. Familiarity with cryptographic theory and cryptographic hardware and/or software design is essential, while knowledge of quantum-safe cryptography, physical unclonable functions and/or side channel analysis is desirable

17:14 [Job][New] Ph.D. Scholarship funded by the Royal Society of UK, Cryptography, Security, and Privacy Research Group, Koç University, ?stanbul, Turkey

  Cryptography, Security & Privacy Research Group at Koç University is looking for exceptional Ph.D. students for a password based authentication project funded by the Royal Society of UK. The student will be registered to Koç University, but will also work jointly with Emiliano De Cristofaro at University College London. The student will visit University College London multiple times. The position may start immediately.

For more information about our group and projects, visit

For applying online, and questions about the application-process, visit

For research questions, contact Asst. Prof. Alptekin Küpçü

17:14 [Job][New] Ph.D. / M.Sc. Scholarships, Cryptography, Security, and Privacy Research Group, Koç University, ?stanbul, Turkey

  Cryptography, Security & Privacy Research Group at Koç University has multiple openings for both M.Sc. and Ph.D. level applications. All accepted applicants will receive competitive scholarships including tuition waiver, housing, monthly stipend, computer, travel support , etc.

For more information about our group and projects, visit

For applying online, and questions about the application-process, visit

For summer internship opportunities, visit

For research questions, contact Asst. Prof. Alptekin Küpçü