5 citations · 5 across the 7 of their papers we have counts for
11 papers
Query-Limited RAM Programs and their Applications
Jiahui Liu, Justin Raizes, Bhaskar Roberts +1
Quantum one-time programs (Broadbent, Gutoski and Stebila, CRYPTO 2013) or OTPs for short, enable a functionality to be encoded into a quantum token that can be evaluated on a sing…
Unclonable Cryptography in Linear Quantum Memory
Omri Shmueli, Mark Zhandry
Quantum cryptography is a rapidly-developing area which leverages quantum information to accomplish classically-impossible tasks. In many of these protocols, quantum states are use…
Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE
James Bartusek, Aparna Gupte, Saachi Mutreja +1
A classical obfuscator for quantum circuits is a classical program that, given the classical description of a quantum circuit , outputs the classical description of a functional…
On One-Shot Signatures, Quantum vs Classical Binding, and Obfuscating Permutations
Omri Shmueli, Mark Zhandry
One-shot signatures (OSS) were defined by Amos, Georgiou, Kiayias, and Zhandry (STOC'20). These allow for signing exactly one message, after which the signing key self-destructs, p…
Public-Key Quantum Fire and Key-Fire From Classical Oracles
Alper Çakan, Vipul Goyal, Omri Shmueli
Quantum fire is a distribution of quantum states that can be efficiently cloned, but cannot be efficiently converted into a classical string. First considered by Nehoran and Zhandr…
Unitary Closed Timelike Curves can Solve all of NP
Omri Shmueli
Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an…
Quantum Algorithms in a Superposition of Spacetimes
Omri Shmueli
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classic…
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA
Omri Shmueli
We present the first non-interactive zero-knowledge argument system for QMA with multi-theorem security. Our protocol setup constitutes an additional improvement and is constructed…
Scalable Pseudorandom Quantum States
Zvika Brakerski, Omri Shmueli
Efficiently sampling a quantum state that is hard to distinguish from a truly random quantum state is an elementary task in quantum information theory that has both computational a…
Post-quantum Zero Knowledge in Constant Rounds
Nir Bitansky, Omri Shmueli
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other sta…
(Pseudo) Random Quantum States with Binary Phase
Zvika Brakerski, Omri Shmueli
We prove a quantum information-theoretic conjecture due to Ji, Liu and Song (CRYPTO 2018) which suggested that a uniform superposition with random \emph{binary} phase is statistica…