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).

06:17 [Pub][ePrint] Verifiable Random Functions from Weaker Assumptions, by Tibor Jager

  Constructing a verifiable random function (VRF) with large input space and full adaptive security from a static complexity assumption, like decisional Diffie-Hellman for instance, has proven to be a challenging task. To date it is not even clear that such a VRF exists. Most known constructions either allow only a small input space of polynomially-bounded size, or do not achieve full adaptive security under a static complexity assumption.

The only known constructions without these restrictions are based on non-static, so-called \"q-type\" assumptions, which are parametrized by an integer q. Since q-type assumptions get stronger with larger q, it is desirable to have q as small as possible. In current constructions q is a polynomial (Hohenberger and Waters, Eurocrypt 2010) or at least linear (Boneh et al., CCS 2010) in the security parameter.

We construct a relatively simple and efficient verifiable random function, based on a q-type assumption where q is only logarithmic in the security parameter. We also describe a verifiable unpredictable function from a similar, but weaker assumption. Both constructions have full adaptive security and large input spaces.

06:17 [Pub][ePrint] Efficient Pairings and ECC for Embedded Systems, by Thomas Unterluggauer and Erich Wenger

  The research on pairing-based cryptography brought forth a wide range of protocols interesting for future embedded applications. One significant obstacle for the widespread deployment of pairing-based cryptography are its tremendous hardware and software requirements. In this paper we present three side-channel protected hardware/software designs for pairing-based cryptography yet small and practically fast: our plain ARM Cortex-M0+-based design computes a pairing in less than one second. The utilization of a multiply-accumulate instruction-set extension or a light-weight drop-in hardware accelerator that is placed between CPU and data memory improves runtime up to six times. With a 10.1 kGE large drop-in module and a 49 kGE large platform, our design is one of the smallest pairing designs available. Its very practical runtime of 162 ms for one pairing on a 254-bit BN curve and its reusability for other elliptic-curve based crypto systems offer a great solution for every microprocessor-based embedded application.

09:44 [Job][New] Associate professor (lecturer) in Computer Security., University of Birmingham, UK

  This is a permanent research and teaching position in one of UK\'s top research-led universities. The Security and Privacy group undertakes research in all fields related to information and cyber security,

privacy, cryptography, etc.

23:53 [Event][New] DAC: Design Automation Conference - Hardware Software Security Track

  Submission: 21 November 2014
Notification: 17 February 2015
From June 7 to June 11
Location: San Francisco , USA
More Information:

23:53 [Event][New] COSADE 2015: 6th Int. Workshop on Constructive Side-Channel Analysis and Secure Design

  Submission: 8 December 2014
Notification: 4 February 2015
From April 13 to April 14
Location: Berlin, Germany
More Information:

09:23 [Event][New] 5th Bar-Ilan Winter School on Cryptography: Advances in Practical MPC

  From February 15 to February 19
Location: Tel Aviv, Israel
More Information:

15:25 [Job][New] Two full-time PhD or Postdoc positions in the area of Wireless Sensor Networks (WSN) Security, Universität Mannheim (Germany) and Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany)

  The positions are funded by the German Research Foundation (DFG) in the project WSNSec (Wireless Sensor Network Security). The project is a collaboration between the Universität Mannheim (Germany) and the Friedrich-Alexander Universität Erlangen-Nürnberg (Germany) where the two positions are located, respectively.


Position 1 at the Working Group for Theoretical Computer Science and IT-Security at Universität Mannheim (Germany) focuses on the theoretical aspects of WSNSec:

- Formalization of attacker models and security goals

- Cryptanalysis of existing cryptographic protocols

- Development of provably secure cryptographic protocols


Position 2 at the Chair for IT-Security Infrastructures (Informatik 1) at the Friedrich-Alexander-Universität Erlangen-Nürnberg (Germany) focuses on the practical aspects of WSNSec:

- Investigation of security strengths and weaknesses of the real WSNs at both the hardware and the software levels

- Implementation of cryptographic protocols for WSNs in simulation environments and on the real sensor nodes


13:29 [Job][New] 4 Research Scientists, Temasek Laboratories at Nanyang Technological University, Singapore

  Temasek Laboratories at Nanyang Technological University, Singapore is seeking candidates for 4 research scientist positions (from fresh post-docs to senior research scientists) in the areas of symmetric key cryptography and lightweight cryptography, supported by a government funded project of duration 2 years.

Salaries are globally competitive and are determined according to the successful applicants accomplishments, experience and qualifications. Interested applicants are encouraged to send early their detailed CVs, cover letter and reference letters.

Review process starts immediately and will continue until all positions are filled.

06:17 [Pub][ePrint] Tuning GaussSieve for Speed, by Robert Fitzpatrick and Christian Bischof and Johannes Buchmann and Ozgur Dagdelen and Florian Gopfert and Artur Mariano and Bo-Yin Yang

  The area of lattice-based cryptography is growing ever-more prominent as a paradigm for quantum-resistant cryptography. One of the most important hard problem underpinning the security of lattice- based cryptosystems is the shortest vector problem (SVP). At present, two approaches dominate methods for solving instances of this problem in practice: enumeration and sieving. In 2010, Micciancio and Voulgaris presented a heuristic member of the sieving family, known as GaussSieve, demonstrating it to be comparable to enumeration methods in practice. With contemporary lattice-based cryptographic proposals relying largely on the hardness of solving the shortest and closest vector problems in ideal lattices, examining possible improvements to sieving algorithms becomes highly pertinent since, at present, only sieving algorithms have been successfully adapted to solve such instances more efficiently than in the random lattice case. In this paper, we propose a number of heuristic improvements to GaussSieve, which can also be applied to other sieving algorithms for SVP.

06:17 [Pub][ePrint] Statistical Properties of the Square Map Modulo a Power of Two, by S. M. Dehnavi and A. Mahmoodi Rishakani and M. R. Mirzaee Shamsabad and Einollah Pasha

  The square map is one of the functions that is used in cryptography. For instance, the square map is used in Rabin encryption scheme, block cipher RC6 and stream cipher Rabbit, in different forms. In this paper we study a special case of the square map, namely the square function modulo a power of two. We obtain probability distribution of the output of this map as a vectorial Boolean function. We find probability distribution of the component Boolean functions of this map. We present the joint probability distribution of the component Boolean functions of this function. We introduce a new function which is similar to the function that is used in Rabbit cipher and we compute the probability distribution of the component Boolean functions of this new map.

03:17 [Pub][ePrint] Weak Instances of PLWE, by Kirsten Eisentraeger and Sean Hallgren and Kristin Lauter

  In this paper we present a new attack on the polynomial version of the Ring-LWE assumption, for certain carefully chosen number fields. This variant of RLWE, introduced in [BV11] and called the PLWE assumption, is known to be as hard as the RLWE assumption for 2-power cyclotomic number fields, and for cyclotomic number fields in general with a small cost in terms of error growth. For general number fields, we articulate the relevant properties and prove security reductions for number fields with those properties. We then present an attack on PLWE for number fields satisfying certain properties.