1 citations · 1 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
Provably Overwhelming Transformer Models with Designed Inputs
Lev Stambler, Seyed Sajjad Nezhadi, Matthew Coudron
We develop an algorithm which, given a trained transformer model as input, as well as a string of tokens of length and an integer , can genera…
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…