4 citations · 4 across the 6 of their papers we have counts for
5 papers · 1 filter
A Note on Boosting Uncloneable Encryption in Microcrypt
James Bartusek, Eli Goldin
In this note, we consider the setting of uncloneable encryption satisfying uncloneable indistinguishability, a form of symmetric key encryption that prevents the cloning of ciphert…
Unclonable Encryption in the Haar Random Oracle Model
James Bartusek, Eli Goldin
We construct unclonable encryption (UE) in the Haar random oracle model, where all parties have query access to for a Haar random unitary . Our scheme sati…
A Meta-Complexity Characterization of Quantum Cryptography
Bruno P. Cavalar, Eli Goldin, Matthew Gray +1
We prove the first meta-complexity characterization of a quantum cryptographic primitive. We show that one-way puzzles exist if and only if there is some quantum samplable distribu…
On Central Primitives for Quantum Cryptography with Classical Communication
Kai-Min Chung, Eli Goldin, Matthew Gray
Recent work has introduced the "Quantum-Computation Classical-Communication" (QCCC) (Chung et. al.) setting for cryptography. There has been some evidence that One Way Puzzles (OWP…
On the Computational Hardness of Quantum One-Wayness
Bruno Cavalar, Eli Goldin, Matthew Gray +3
There is a large body of work studying what forms of computational hardness are needed to realize classical cryptography. In particular, one-way functions and pseudorandom generato…