Improving semi-device-independent randomness certification by entropy accumulation
Carles Roch I Carceller, Lucas Nunes Faria, Zheng-Hao Liu, Nicol\`o Sguerso, Ulrik Lund Andersen, Jonas Schou Neergaard-Nielsen, Jonatan Bohr Brask

TL;DR
This paper enhances semi-device-independent quantum randomness certification by applying the Entropy Accumulation Theorem, enabling better randomness guarantees and finite-size analysis in untrusted measurement scenarios.
Contribution
It extends the entropy accumulation approach to semi-device-independent settings, improving randomness certification without assuming independent and identical rounds.
Findings
Improved randomness certification using entropy accumulation.
Finite-size analysis without IID assumptions.
Enhanced security guarantees in untrusted measurement scenarios.
Abstract
Certified randomness guaranteed to be unpredictable by adversaries is central to information security. The fundamental randomness inherent in quantum physics makes certification possible from devices that are only weakly characterised, i.e. requiring little trust in their implementation. It was recently shown that the amount of certifiable randomness can be greatly improved using the so-called Entropy Accumulation Theorem generalised to prepare-and-measure settings. Furthermore, this approach allows a finite-size analysis which avoids assuming that all rounds are independent and identically distributed. Here, we demonstrate this improvement in semi-device-independent randomness certification from untrusted measurements.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhysical Unclonable Functions (PUFs) and Hardware Security · VLSI and Analog Circuit Testing · Integrated Circuits and Semiconductor Failure Analysis
