Metraipolis › archive › dc_eb604c58fc63

Finality Before Disclosure for Ledger Authenticators in the Quantum Random Oracle Model — arXiv:2608.18605

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.18605
License (as archived)
CC0-1.0
Archived
2026-10-18T13:51:50.658Z
SHA-256 of the archived text
6c587deff47e31dd63833118e61ff2deee2c3a7c190676982b99bddfaedcb404
Stable URL of this page
https://metraipolis.com/documento/dc_eb604c58fc63

How to cite

Finality Before Disclosure for Ledger Authenticators in the Quantum Random Oracle Model — arXiv:2608.18605 — arXiv (en), https://arxiv.org/abs/2608.18605 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eb604c58fc63 (Metraipolis archive dc_eb604c58fc63, sha256 6c587deff47e31dd63833118e61ff2deee2c3a7c190676982b99bddfaedcb404)
BibTeX
@misc{dceb604c58fc63,
  title = {Finality Before Disclosure for Ledger Authenticators in the Quantum Random Oracle Model — arXiv:2608.18605},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.18605},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eb604c58fc63; sha256 6c587deff47e31dd63833118e61ff2deee2c3a7c190676982b99bddfaedcb404},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18605. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Public ledgers increasingly authorize state transitions using prior transactions, finalized state, timing, and ordering rather than only a public key, message, and portable signature. We introduce ledger authenticators and $\LAEUF$, an unforgeability experiment for reactive authorization protocols whose public judgment algorithm reads a finalized transcript. The model separates authentication safety from ledger liveness and captures canonical transition freshness, adaptive corruption, exposure before inclusion, censorship, and adversarial ordering. We identify two conditional resource boundaries. An authenticator satisfying our single event conditions yields a contextual one-time signature. Within our rebindable reveal class, safety requires computational post-disclosure non-admissibility. When precursor admission uses only public computation and ledger scheduling, this condition is enforced by closing the evidence eligible to use a disclosed credential. If newly constructed evidence remains admissible after disclosure, censoring the honest reveal gives a forgery. We then define a joint ledger and quantum random oracle execution model in which quantum state persists across classical finalization cuts and oracle evaluations made through the ledger are charged. For a closed finalized target set of size at most $K$, we prove the bound $3\beta_{\mathsf{cut}}^2+3c_{\mathsf{co}}KQ^2/2^\lambda+6\ell/2^\lambda$, where $\beta_{\mathsf{cut}}$ accounts for fresh openings already present at the cut. A commit, close, reveal authenticator instantiates the framework and obtains a multi-user lifetime QROM bound.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-20 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2608.18605 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T13:49:54.228Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).