International Association
for Cryptologic Research

The Applied Security and Information Assurance (APSIA) research group invites applications from highly-motivated candidates holding a PhD with a strong track record to contribute to the research specialities, see topics below. The APSIA team of SnT is a dynamic research group, some 15 strong, conducting research on the design and analysis of crypto primitives and protocols, security-critical systems, information assurance, and privacy. Specialities of the group include quantum and post-quantum (quantum resistant) cryptography, secure voting systems. For further information you may check: www.uni.lu/snt-en/research-groups/apsia/

Closing date for applications:

Contact: Peter Y A Ryan

More information: http://emea3.mrted.ly/3q4lu

Do you want to be part of QuSoft, the world-leading centre for quantum software in Amsterdam? The University of Amsterdam (UvA) and the Centrum Wiskunde & Informatica (CWI) each have an opening for a tenure-track or tenured position in the area of quantum computing. We are seeking applications from both early-career researchers (as early as final year of PhD) and highly experienced researchers (comparable to associate or full professor level). Depending on the level of seniority, a tenure-track or a tenured position will be offered to you.

Both positions will be part of QuSoft, the Dutch research centre for quantum software, launched in 2015 to combine the quantum computing research of CWI and of the University of Amsterdam. QuSoft’s mission is to use the extraordinary properties of quantum mechanics, such as superposition, interference and entanglement, to develop new algorithms, communication protocols, and applications for small and medium-sized prototypes as well as larger quantum computers. QuSoft values diversity and inclusion, and improving the gender representation within QuSoft is an urgent concern. To this end, we will, among equally qualified candidates, prioritise applications from women researchers (including identifying as).

The positions are in the area of quantum computing, particularly in one or more of the following subareas:

• quantum algorithms,
• quantum complexity theory,
• quantum error-correction and fault-tolerance,
• quantum cryptography,
• quantum simulation of molecules and materials,
• quantum information theory.

  Closing date for applications:

  Contact: Stacey Jeffery

  More information: https://vacatures.uva.nl/UvA/job/QuSoft/800609602/

The Quantum Information (QI) and PolSys teams at LIP6, Sorbonne University, are looking for a postdoctoral researcher to work on research topics at the intersection of modern, post-quantum, and quantum cryptography. The potential topics include, but are not limited to, secure quantum multi-party computation, Hybrid Authenticated Authenticated Key Exchange, ....

The post-doc will conduct research at the intersection of theoretical cryptography and practical experiments on a quantum optical testbed to demonstrate a practical quantum advantage in terms of security and/or efficiency for advanced quantum cryptographic protocols.

The post-doc will be jointly supervised by Alex B. Grilo (CNRS, Sorbonne University), Eleni Diamanti (CNRS, Sorbonne University), and Ludovic Perret (EPITA & Sorbonne University). The ideal candidate will hold a PhD in quantum cryptography or cryptography with a strong motivation to work at the intersection of these two domains. Programming skills are a plus.

The position is for 12 months, renewable for up to 24 months, with a flexible start date. It is offered in the framework of the QSNP project, a European Quantum Flagship project aiming to develop quantum cryptography technology.

The PolSys team has strong expertise in post-quantum-cryptography whilst the QI team is an interdisciplinary research group covering computer science, theoretical physics and experimental quantum optics. We are based in LIP6, Sorbonne Université, in central Paris, and are founding members of interdisciplinary centers the Quantum Information Centre Sorbonne and the Paris Centre for Quantum Technologies. We strive to promote equality, diversity, inclusion and tolerance.

Applicants should send their CV, and a cover letter and arrange for at least two references to be sent to the contact person given below. The deadline for applications is 30/09/2024.

Closing date for applications:

Contact: Ludovic Perret

We are proud to announce the winners of the 2024 IACR Test-of-Time Award for Crypto.

The IACR Test-of-Time Award honors papers published at the 3 IACR flagship conferences 15 years ago which have had a lasting impact on the field.

The Test-of-Time award for Crypto 2009 is awarded to the following two papers:

Dual-System Encryption, by Brent Waters.
For introducing the dual-system technique, breaking through the partitioning-reductions barrier of pairing-based cryptography and enabling new and improved pairing-based cryptosystems.

Reconstructing RSA Private Keys from Random Key Bits, by Nadia Heninger and Hovav Shacham.
For introducing the go-to tool for side channel attacks on CRT-RSA that played a pivotal role in helping secure the Internet.

For more information, see https://www.iacr.org/testoftime.

Congratulations to all winners!

Event date: 28 April to 1 May 2025

Event date: 17 March to 21 March 2025

At EUROCRYPT'20, Bao et al. have shown that three-round cascading of $\textsf{LRW1}$ construction, which they dubbed as $\textsf{TNT}$, is a strong tweakable pseudorandom permutation that provably achieves $2n/3$-bit security bound. Jha et al. showed a birthday bound distinguishing attack on $\textsf{TNT}$ and invalidated the proven security bound and proved a tight birthday bound security on the $\textsf{TNT}$ construction in EUROCRYPT'24. In a recent work, Datta et al. have shown that four round cascading of the $\textsf{LRW1}$ construction, which they dubbed as $\textsf{CLRW1}^4$ is a strong tweakable pseudorandom permutation that provably achieves $3n/4$-bit security. In this paper, we propose a variant of the $\textsf{TNT}$ construction, called $\textsf{b-TNT1}$, and proved its security up to $2^{3n/4}$ queries. However, unlike $\textsf{CLRW1}^4$, $\textsf{b-TNT1}$ requires three block cipher calls along with a field multiplication. Besides, we also propose another variant of the $\textsf{TNT}$ construction, called $\textsf{b-TNT2}$ and showed a similar security bound. Compared to $\textsf{b-TNT1}$, $\textsf{b-TNT2}$ requires four block cipher calls. Nevertheless, its execution of block cipher calls can be pipelined which makes it efficient over $\textsf{CLRW1}^4$. We have also experimentally verified that both $\textsf{b-TNT1}$ and $\textsf{b-TNT2}$ outperform $\textsf{CLRW1}^4$.