IACR News
If you have a news item you wish to distribute, they should be sent to the communications secretary. See also the events database for conference announcements.
Here you can see all recent updates to the IACR webpage. These updates are also available:
03 July 2025
Universitat Oberta de Catalunya (UOC)
Closing date for applications:
Contact: Helena Rifà Pous
More information: https://selection.uoc.edu/web/offersjob/offerdetails.aspx?offerID=7AEF220E729D78B226BA96C7B4C4059A5ECD9AE0846AB024E66E32BE291A123B
LuxQuantum, Esch-sur-Alzette, Luxembourg
Company Overview
We’re LuxQuantum, a dynamic startup tackling the exciting and complex challenges in quantum cybersecurity. Our goal is to build innovative solutions that address interoperability bottlenecks in quantum communications by seamlessly integrating quantum key distribution (QKD) and post-quantum cryptography (PQC). We’re looking for someone to join our small team—not just as a colleague but as a friend—to help lead this mission.
We’re more than a company; we’re a team of innovators, learners, and dreamers. If you want to explore cutting-edge technology with people who genuinely enjoy working together, we’d love to meet you!
Role Overview
As a Quantum Cybersecurity Engineer, you’ll play a key role in developing solutions to tackle interoperability issues in quantum cybersecurity. Think of yourself as both a problem-solver and a collaborator, directly contributing to the creation of leading-edge quantum cybersecurity solutions in an environment where every voice matters.
Closing date for applications:
Contact: contact@luxquantum.lu
More information: https://www.siliconluxembourg.lu/quantum-cybersecurity-engineer-luxquantum/
University of Sheffield
Closing date for applications:
Contact: Dr. Prosanta Gope (p.gope@sheffield.ac.uk)
Indraprastha Institute of Information Technology Delhi
I am looking for a motivated and curious student to join my group as a PhD student in the area of cryptanalysis of symmetric ciphers. The research will span classical and quantum cryptanalysis, with intersections in machine learning and cipher design. You are expected to have a strong background in Computer Science or related fields, solid programming skills (C, C++, Python, etc.), and basic knowledge of cryptography and algorithms. Familiarity with Cryptographic tools (SageMath, PyCryptodome, etc.) and exposure to ML is desirable.
You should have a B.Tech/M.Tech (Computer Science or IT) from a recognized institution. CSIR/UGC JRF would be preferable. Stipend will be as per institute norms (INR 60,000 per month, including HRA).
How to apply:
Send an email attached with your CV and transcripts/mark sheets to
ravi.anand@iiitd.ac.in, with the subject line “Position -- PhD” by July 15, 2025.
Closing date for applications:
Contact: Ravi Anand (ravi.anand@iiitd.ac.in), IIIT Delhi, New Delhi, India
More information: https://docs.google.com/document/d/1c_wEWSDtR0irAz4T29HAl3o2AWqLZmoWjFtzOJETjQQ/edit?tab=t.0
02 July 2025
Alexandra Boldyreva, Deep Inder Mohan, Tianxin Tang
Iván Blanco Chacón, Raúl Durán Díaz, Rodrigo Martín Sanchez-Ledesma
01 July 2025
Cryptography Theory and Technology Research Laboratory of Institute of Information Engineering, CAS
We are seeking excellent researchers to join the Cryptography Theory and Technology Research Laboratory at IIE. Applicants are encouraged to apply to work on one of the following areas:
- Post-Quantum Cryptography
- Fully Homomorphic Encryption
- Zero-Knowledge Proof
- Symmetric-Key Cryptography
Positions at PostDoc, Assistant/Associate/Full Professor levels are available. Initial appointments are normally made on a fixed-term contract. Subsequent contract renewal, promotion and tenure all follow standard practices.
Application Materials Required:
- Curriculum Vitae
- 1-5 Representative publications
- Research statement
Review of applications will begin July 1, 2025 and continue until positions are filled.
Closing date for applications:
Contact: Xianhui Lu (luxianhui@iie.ac.cn); Yi Deng (deng@iie.ac.cn); Song Tian (tiansong@iie.ac.cn)
30 June 2025
National Sun Yat-sen University, Department of Computer Science and Engineering; Kaohsiung, Taiwan
Responsibilities: Apart from academic work, students must be involved in several activities in a group or individually, such as (not limited to):
Requirements: (02 MS and 02 PhD positions)
Apart from the university's basic admission policies (https://cse.nsysu.edu.tw/?Lang=en), students are desired to have the following key requirements:
Scholarship:
What students can expect:
Submit your detailed CV by August 30, 2025.
Application Deadline: September 30, 2025
Closing date for applications:
Contact: Arijit Karati (arijit.karati@mail.cse.nsysu.edu.tw)
More information: https://oia.nsysu.edu.tw/static/file/308/1308/img/NSYSUAY2025-2026AdmissionApplicationGuideforInternationalDegreeStudents.pdf
National Sun Yat-sen University, Department of Computer Science and Engineering; Kaohsiung, Taiwan
Essential Qualifications:
Application Deadline: 15-08-2025
Closing date for applications:
Contact: Arijit Karati (arijit.karati@mail.cse.nsysu.edu.tw)
More information: https://www.canseclab.com/
Zhenhua Zou, Zhuotao Liu, Jinyong Shan, Qi Li, Ke Xu, Mingwei Xu
Ya-Nan Li, Yaqing Song, Qiang Tang, Moti Yung
In this paper, we initiate the needed study of efficient end-to-end encrypted Git services. Specifically, we formally define the syntax and critical security properties, and then propose two constructions that provably meet those properties. Moreover, our constructions have the important property of platform-compatibility: They are compatible with current Git servers and reserve all basic Git operations, thus can be directly tested and deployed on top of existing platforms. Furthermore, the overhead we achieve is only proportional to the actual difference caused by each edit, instead of the whole file (or even the whole repository) as is the case with existing works. We implemented both constructions and tested them directly on several public GitHub repositories. Our evaluations show (1) the effectiveness of platform-compatibility, and (2) the significant efficiency improvement we got (while provably providing much stronger security than prior ad-hoc treatments).
Prabhanjan Ananth, Amit Behera, Zikuan Huang
Ivan Damgård, Shravani Patil, Arpita Patra, Lawrence Roy
When $O(n)$ overhead is inevitable, one can explore if this overhead can be pushed to the preprocessing phase and the online phase can be achieved with $O(1)$ overhead. This result was recently achieved in the synchronous setting, in fact, with GOD guarantee. We show this same result in the asynchronous setting. This was previously open since the main standard approach to getting constant overhead in a synchronous on-line phase fails in the asynchronous setting. In particular, this shows that we do not need to settle for abort security to get an asynchronous perfectly secure protocol with overheads $O(n)$ and $O(1)$.
Lastly, in the synchronous setting, we show that perfect secure MPC with abort requires only 2 rounds, in contrast to protocols with GOD that require 4 rounds.
Hao Lin, Mingqiang Wang, Weiqiang Wen, Shi-Feng Sun, Kaitai Liang
Daniël van Gent, Wessel van Woerden
In this work we generalize Szydlo's search to distinguish reduction in two ways. Firstly, we generalize the reduction to any lattice isomorphic to $\Gamma^n$, where $\Gamma$ is a fixed base lattice. Secondly, we allow $\Gamma$ to be a module lattice over any number field. Assuming the base lattice $\Gamma$ and the number field $K$ are fixed, our reduction is polynomial in $n$.
As a special case we consider the module lattice $\mathcal{O}_K^2$ used in the module-LIP based signature scheme HAWK, and we show that one can solve the search problem, leading to a full key recovery, with less than $2d^2$ distinguishing calls on two lattices each, where $d$ is the degree of the power-of-two cyclotomic number field and $\mathcal{O}_K$ its ring of integers.
Xichao Hu, Lin Jiao, Dengguo Feng, Yonglin Hao, Senpeng Wang, Yongqiang Li, Xinxin Gong
Dina Hesse, Jakob Feldtkeller, Tim Güneysu, Julius Hermelink, Georg Land, Markus Krausz, Jan Richter-Brockmann
In this paper, we present an unsupervised single-trace side-channel attack on a tenth order masked implementation of fixed-weight polynomial sampling, which has also been proven to be secure in the t-probing model. Both attacks reveal a mismatch between the correct, well-understood theory of the t-probing model and its practical application, since the security proofs are valid, yet the attacks still succeed at high noise levels. Therefore, we take a closer look at the underlying causes and the assumptions that are made for transferring t-probing security to practice. In particular, we investigate the amount of noise required for this transfer. We find that, depending on the design decisions made, this can be very high and difficult to achieve.
Consequently, we examine the factors impacting the required amount of noise and that should be considered for practically secure implementations. In particular, non-uniformly distributed shares - a setting that is increasingly encountered in post-quantum cryptographic algorithms - could lead to an increased noise requirement, and thus it could reduce the security level of the masking scheme. Our analysis then allows us to provide practical guidelines for implementation designers, thereby facilitating the development of practically secure designs.
Shuaishuai Li, Liqiang Peng, Weiran Liu, Cong Zhang, Zhen Gu, Dongdai Lin
This work studies SPIR in the batch setting (BatchSPIR), where the client wants to retrieve multiple entries. In particular, we focus on the case of bit entries, which has important real-world applications. We set up the connection between bit-entry information retrieval and set operation, and propose a black-box construction of BatchSPIR from Private Set Intersection (PSI). By applying an efficient PSI protocol with asymmetric set sizes, we obtain our BatchSPIR protocol named $\mathsf{BitBatSPIR}$. We also introduce several optimizations for the underlying PSI. These optimizations improve the efficiency of our concrete BatchSPIR construction as well as the PSI protocol.
We implement $\mathsf{BitBatSPIR}$ and compare the performance with the state-of-the-art PIR protocol in the batch setting. Our experimental results show that $\mathsf{BitBatSPIR}$ not only achieves a stronger security guarantee (symmetric privacy) but also has a better performance for large databases, especially in the Wide Area Network (WAN) setting.