Paper 2026/356

Publicly Certifiable Min-Entropy Without Quantum Communication

Barak Nehoran, Columbia University

Or Sattath, Ben-Gurion University of the Negev

Abstract

Is it possible to publicly certify that a string was sampled from a high min-entropy distribution? Certified randomness protocols, such as Brakerski et al. (FOCS 2018) enable private certification—Alice can convince Bob—but it does not yield public certification. We construct a certified min-entropy scheme with the following properties: (1) public certification, so Alice can convince Bob, Charlie, and Dave; (2) all prover–verifier communication is classical; (3) transferability—if Bob has already been convinced, he can subsequently convince Eve and Frank; and (4) classical verification—Grace can be convinced even without a quantum computer, at the cost of losing transferability. Assuming quantum one-shot signatures (and variants), we construct quantum fire with new properties and use it to obtain our publicly certifiable min-entropy scheme. Both primitives can be instantiated from sub-exponential iO and LWE, and our quantum fire scheme is the first standard-model construction of quantum fire.

@misc{cryptoeprint:2026/356,
      author = {Ofer Casper and Barak Nehoran and Or Sattath},
      title = {Publicly Certifiable Min-Entropy Without Quantum Communication},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/356},
      year = {2026},
      url = {https://eprint.iacr.org/2026/356}
}