19 citations · 56 across the 28 of their papers we have counts for
Showing 2026 · quant-phShow all
3 papers · 2 filters
quant-ph2026
Quantum Time-Lock Puzzles in the Quantum Random Oracle Model
Prabhanjan Ananth, Yao-Ting Lin
A time-lock puzzle allows a sender to hide a message in a puzzle such that recovering the message requires substantially more sequential computation than the time required to gener…
quant-ph2026
Non-Local Search-to-Decision Reduction over F2, and More
Prabhanjan Ananth
Non-local search-to-decision asks whether the difficulty of two non-communicating (non-local) parties both predicting x given a bipartite state (that possibly depends on x) implies…
quant-ph2026
Unconditional Unclonable Encryption
Prabhanjan Ananth, Amit Sahai, Seyoon Ragavan
We give an unconditional construction of information-theoretically secure one-time private-key unclonable encryption for one-bit messages, with efficient encryption and decryption…