0

Tight adaptive reprogramming in the QROM
The random oracle model (ROM) enjoys widespread popularity, mostly because it tends to allow for tight and conceptually simple proofs …
DOI HAL
Classical-quantum network coding: a story about tensor
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can …
PDF HAL
A Unified Framework For Quantum Unforgeability
In this paper, we continue the line of work initiated by Boneh and Zhandry at CRYPTO 2013 and EUROCRYPT 2013 in which they formally …
HAL
Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs
Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic …
HAL
Mitigating errors by quantum verification and post-selection
Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing …
HAL
Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States
Due to the special no-cloning principle, quantum states appear to be very useful in cryptography. But this very same property also has …
HAL
Randomized Benchmarking with Stabilizer Verification and Gate Synthesis
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not …
HAL
Verification of graph states in an untrusted network
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, …
HAL
Efficient verification of Boson Sampling
The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to …
DOI HAL
Efficient verification of Boson Sampling
The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to …
PDF DOI HAL