Ziad Chaoui

Ziad Chaoui

Auto-generated profile, based on publicly available information

Ziad Chaoui

Technische Universität Berlin

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 November 2025 in Physical Review Applied
Verified
Journal Article
Open access
JJJarn de Jong
Jarn de Jong
SSSantiago Scheiner
Santiago Scheiner
NSNaomi R. Solomons
Naomi R. Solomons
ZCZiad Chaoui
Ziad Chaoui
DMDamian Markham
Damian Markham
APAnna Pappa
Anna Pappa
Anonymity and privacy are two key properties of modern communication networks. In quantum networks, distributed quantum sensing has emerged as a powerful use case, with applications to clock synchronization, detecting gravitational effects, and more. In this work, we develop a new protocol that, for the first time, combines the different cryptographic properties of anonymity and privacy for the task of distributed parameter estimation. That is, we present a protocol that allows a selected subset of network participants to anonymously collaborate in estimating the average of their private parameters. Crucially, this is achieved without disclosing either the individual parameter values or the identities of the participants, neither to each other nor to the broader network.

8 January 2026 in IACR Communications in Cryptology
Verified
Journal Article
Open access
PDF file
FWFabian Wiesner
Fabian Wiesner
ZCZiad Chaoui
Ziad Chaoui
DKDiana Kessler
Diana Kessler
APAnna Pappa
Anna Pappa
MKMartti Karvonen
Martti Karvonen
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows using quantum states from an untrusted source. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.

1 June 2026 in Physical Review A
Verified
Journal Article
Open access
ZCZiad Chaoui
Ziad Chaoui
APAnna Pappa
Anna Pappa
MRMatteo Rosati
Matteo Rosati
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both classical and quantum, is impossible. In this work, we demonstrate that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit-commitment schemes. Specifically, we prove that in any perfectly hiding bit-commitment protocol, an honestly committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment. To illustrate our findings, we present an example protocol.

12 December 2025 in arXiv
Verified
Preprint
Open access
PDF file
FWFabian Wiesner
Fabian Wiesner
ZCZiad Chaoui
Ziad Chaoui
DKDiana Kessler
Diana Kessler
APAnna Pappa
Anna Pappa
MKMartti Karvonen
Martti Karvonen
Quantum state verification plays a vital role in many quantum cryptographic protocols, as it allows the use of quantum states from untrusted sources. While some progress has been made in this direction, the question of whether the most prevalent type of quantum state verification, namely cut-and-choose verification, can be efficient and secure, is still not answered in full generality. In this work, we show a fundamental limit for quantum state verification for all cut-and-choose approaches used to verify arbitrary quantum states. We provide a no-go result showing that the cut-and-choose techniques cannot lead to quantum state verification protocols that are both efficient in the number of rounds and secure. We show this trade-off for stand-alone and composable security, where the scaling of the lower bound for the security parameters renders cut-and-choose quantum state verification effectively unusable.