Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
Advances in Cryptology -- CRYPTO 2022, Lecture Notes in Computer Science , series =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.
citing papers explorer
-
A Modular Approach to Succinct Arguments for QMA
Modular construction of succinct arguments for QMA via OSP-based interactive protocol plus collapsing-hash communication compression compiler, without LWE.
-
Time-Delayed Publicly Verifiable Quantum Computation for Classical Verifiers
A non-interactive time-delayed publicly verifiable scheme for quantum computation compiled from private 2-round protocols via time-lock puzzles and commitments, proven secure in the quantum random oracle model with CRS.