activity
20132026
most citedGazelle: A Low Latency Framework for Secure Neural Network Inference

175 citations · 262 across the 24 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2026

Separating Quantum and Classical Advice with Good Codes

John Bostanci, Andrew Huang, Vinod Vaikuntanathan

We show an unconditional classical oracle separation between the class of languages that can be verified using a quantum proof () and the class of languages that can…

quant-ph2025

A Simple and Efficient One-Shot Signature Scheme

Andrew Huang, Vinod Vaikuntanathan

One-shot signatures (OSS) are a powerful and uniquely quantum cryptographic primitive which allows anyone, given common reference string, to come up with a public verification key…

quant-ph2024

Quantum State Obfuscation from Classical Oracles

James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan

A major unresolved question in quantum cryptography is whether it is possible to obfuscate arbitrary quantum computation. Indeed, there is much yet to understand about the feasibil…

quant-ph2023★ 2 cited

Space-Efficient and Noise-Robust Quantum Factoring

Seyoon Ragavan, Vinod Vaikuntanathan

We provide two improvements to Regev's recent quantum factoring algorithm (Journal of the ACM 2025), addressing its space efficiency and its noise-tolerance. Our first contribution…

quant-ph2023★ 1 cited

Revocable Cryptography from Learning with Errors

Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan

Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically. In this work,…

quant-ph2022★ 1 cited

Succinct Classical Verification of Quantum Computation

James Bartusek, Yael Tauman Kalai, Alex Lombardi +5

We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in th…

quant-ph2022★ 1 cited

Quantum Advantage from Any Non-Local Game

Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan +1

We show a general method of compiling any -prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guar…

quant-ph2020★ 2 cited

Oblivious Transfer is in MiniQCrypt

Alex B. Grilo, Huijia Lin, Fang Song +1

MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achie…