{
  "abstract": "Quantum information enables many cryptographic primitives that are impossible in the classical world. A line of works has developed cryptographic protocol under the assumption that quantum adversaries are restricted to noisy intermediate-scale quantum (NISQ) computing power, enabling strong one-time functionalities. But the advent of early fault-tolerant quantum computers eras will allow deeper logical quantum circuits, calling into questions the applicability of these NISQ-based assumptions. In this work, we adapt the classically accessible random oracle model (CAROM) as in [BDF+11] and [AK22], in which adversaries are only allowed to classically query the random oracle. The restriction is well motivated for NISQ quantum adversaries and may remain plausible in the presence of early fault-tolerant quantum computers. Then, we show that an efficient simulation-secure one-time memory (OTM) is possible under CAROM. Our protocol uses only BB84 states and has quadratic communication: for a $λ$-bit message and integer-valued parameters $n=n(λ)$ and $\\ell=\\ell(λ)$, the construction uses $n\\ell$ qubits and $(n+2)λ$ classical bits, and for any quantum adversary with at most $2^{\\ell/2-1}-1$ classical queries to the random oracle, its simulation advantage is at most $(n+3)\\left(\\frac{3}{4}\\right)^n.$ Hence exponentially small simulation advantage in $n$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.32603",
  "author_total": 3,
  "authors": [
    {
      "name": "Boyang Chen"
    },
    {
      "name": "Tianren Liu"
    },
    {
      "name": "Luojian Wei"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/2dqbvn2w8qw3z.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.32603",
  "fulltext_url": null,
  "id": "2dqbvn2w8qw3z",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.32603",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2609.32603",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-26",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/2dqbvn2w8qw3z.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:12Z",
      "native_id": "2609.32603",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.32603"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model",
  "title_text": "Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:12Z",
  "url": "https://research.draconitic.com/paper/2dqbvn2w8qw3z",
  "venue": "arXiv",
  "versions": []
}