6 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…
Certified Randomness with Optimal Rate
Siddhartha Jain, Saachi Mutreja, Bhaskar Roberts
The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require ne…
Unconditional Certified Randomness without Structure
Andrea Coladangelo, Dakshita Khurana, Saachi Mutreja +3
We obtain a certified randomness protocol in the quantum random oracle model. The protocol is non-interactive and publicly verifiable with a classical verifier, and is based on Yam…
Certified Randomness without Structure Against Shallow-Query Adversaries
Dakshita Khurana, Bhaskar Roberts, Avishay Tal
In a recent breakthrough, Yamakawa and Zhandry (J. ACM 2024) constructed a proof of quantumness in the quantum random oracle model (QROM) in which the quantum prover samples a code…
On Best-Possible One-Time Programs
Aparna Gupte, Jiahui Liu, Luowen Qian +3
One-time programs (OTPs) aim to let a user evaluate a program on a single input while revealing nothing else. Classical OTPs require hardware. Quantum measurement suggests a physic…
Quantum One-Time Programs, Revisited
Aparna Gupte, Jiahui Liu, Justin Raizes +2
One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user's choice, but not on a second input. Classically, they a…