activity
20242026
collaborators

7 papers

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…

cs.CR2026

Undetectable Conversations Between AI Agents via Pseudorandom Noise-Resilient Key Exchange

Vinod Vaikuntanathan, Or Zamir

AI agents are increasingly deployed to interact with other agents on behalf of users and organizations. We ask whether two such agents, operated by different entities, can carry ou…

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…

cs.CR2025

A system capable of verifiably and privately screening global DNA synthesis

Carsten Baum, Jens Berlips, Walther Chen +28

Printing custom DNA sequences is essential to scientific and biomedical research, but the technology can be used to manufacture plagues as well as cures. Just as ink printers recog…

quant-ph2025

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…

cs.CR2025

Improving Algorithmic Efficiency using Cryptography

Vinod Vaikuntanathan, Or Zamir

Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to imp…