2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Digital signatures with classical shadows on near-term quantum computers
Pradeep Niroula, Minzhao Liu, Sivaprasad Omanakuttan +15
Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing pro…
Certified randomness amplification by dynamically probing remote random quantum states
Minzhao Liu, Pradeep Niroula, Matthew DeCross +49
Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into n…
On the Equivalence between Classical Position Verification and Certified Randomness
Fatih Kaleoglu, Minzhao Liu, Kaushik Chakraborty +4
Gate-based quantum computers hold enormous potential to accelerate classically intractable computational tasks. Random circuit sampling (RCS) is the only known task that has been a…
Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography
Prabhanjan Ananth, Fatih Kaleoglu, Henry Yuen
Unclonable cryptography is concerned with leveraging the no-cloning principle to build cryptographic primitives that are otherwise impossible to achieve classically. Understanding…
Pseudorandom Isometries
Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu +1
We introduce a new notion called -secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an -qubit state to an …