1 citations · 1 across the 10 of their papers we have counts for
8 papers · 1 filter
Towards Simple and Useful One-Time Programs in the Quantum Random Oracle Model
Lev Stambler
We construct simulation-secure one-time memories (OTM) in the random oracle model, and present a plausible argument for their security against quantum adversaries with bounded and…
A Note on Publicly Verifiable Quantum Money with Low Quantum Computational Resources
Fabrizio Genovese, Lev Stambler
In this work we present a publicly verifiable quantum money protocol which assumes close to no quantum computational capabilities. We rely on one-time memories which in turn can be…
New Quantum Internet Applications via Verifiable One-Time Programs
Lev Stambler
We introduce Verifiable One-Time Programs (Ver-OTPs) and use them to construct single-round Open Secure Computation (OSC), a novel primitive enabling applications like (1) single-r…
Cryptography without Long-Term Quantum Memory and Global Entanglement: Classical Setups for One-Time Programs, Copy Protection, and Stateful Obfuscation
Lev Stambler
We show how oracles which only allow for classical query access can be used to construct a variety of quantum cryptographic primitives which do not require long-term quantum memory…
Information Theoretic One-Time Programs from Geometrically Local Adversaries
Lev Stambler
We show how to construct simulation secure one-time memories, and thus one-time programs, without computational assumptions in the presence of constraints on quantum hardware. Spec…
Quantum One-Time Memories from Stateless Hardware, Random Access Codes, and Simple Nonconvex Optimization
Lev Stambler
We present a construction of one-time memories (OTMs) using classical-accessible stateless hardware, building upon the work of Broadbent et al. and Behera et al.. Unlike the aforem…
Effective Distance of Higher Dimensional HGPs and Weight-Reduced Quantum LDPC Codes
Shi Jie Samuel Tan, Lev Stambler
Quantum error correction plays a prominent role in the realization of quantum computation, and quantum low-density parity-check (qLDPC) codes are believed to be practically useful…
Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes
Lev Stambler, Anirudh Krishna, Michael E. Beverland
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome o…