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:
07 July 2025
Fuyuki Kitagawa, Takashi Yamakawa
In this work, we address these fundamental questions concerning SDE. Our contributions are threefold.
New security notion: We introduce a strengthened indistinguishability-based security notion for SDE, which we call CPA+ anti-piracy security. We show that CPA+ security unifies the existing security notions for SDE, as detailed in the third item.
New construction: We present an SDE scheme that satisfies CPA+ anti-piracy security, based solely on polynomially secure iO and OWFs. In addition to relying on weaker and more general assumptions, our SDE scheme offers a significant advantage over the scheme of Coladangelo et al., as both the construction and its security proof are much simpler.
Relationships among security notions: We demonstrate that CPA+ anti-piracy security implies all existing security notions for SDE, with the sole exception of identical challenge ciphertext security proposed by Georgiou and Zhandry (EPRINT 2020). Although we do not establish a direct implication from CPA+ anti-piracy security to identical challenge ciphertext security, we provide a generic transformation from an SDE scheme satisfying the former to one achieving the latter in the quantum random oracle model. Additionally, we establish various relationships among different security notions for SDE. By combining these results with our SDE construction, we derive several new feasibility results.
Anisha Mukherjee, Sujoy Sinha Roy
Alexandre Adomnicăi, Wonseok Choi, Yeongmin Lee, Kazuhiko Minematsu, Yusuke Naito
Debadrita Talapatra, Nimish Mishra, Debdeep Mukhopadhyay
As an use-case of our proposed $\Sigma_2$ protocol, we showcase a construction of a quantum-safe Searchable Symmetric Encryption (SSE) scheme by plugging a prior LWR based SSE scheme from (EuroS&P 2023) with our $\Sigma_2$ protocol. Concretely, using our $\Sigma_2$ protocol for linear relations, we prove the correctness of an encrypted search result in a zero-knowledge manner. We implement our verifiable SSE framework and show that the overhead of an extra verification round is negligible ($0.0023$ seconds) and retains the asymptotic query execution time complexity of the original SSE scheme.
Our work establishes results on zero-knowledge proof systems that can be of independent interest. By shifting the setting from RLWE to RLWR, we gain significant (i) efficiency improvements in terms of communication complexity by $O(M)$ (since some prior works on RLWE require rejection sampling by a factor of $M$), as well as (ii) very short proof size ($8.4$ KB) and tighter parameters (since RLWR does not explicitly manipulate error polynomials like RLWE).
Debadrita Talapatra, Sikhar Patranabis, Debdeep Mukhopadhyay
Christodoulos Pappas, Dimitrios Papadopoulos
At a technical level, we introduce two new building blocks that may be of independent interest: (i) the first sumcheck protocol for products of polynomials with optimal prover time in the streaming setting, and (ii) a novel multi-linear plausibly post-quantum polynomial commitment that outperforms all prior works in prover time (and can be tuned to work in a space-efficient manner). We build Hobbit by combining the above with a modified version of HyperPlonk, providing an explicit routine to stream access to the circuit evaluation.
Yi-Fan Tseng, Yi-Jiin Lu, Tien-Lin Tsai, Zi-Yuan Liu
Hayder Tirmazi
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).