1 citations · 1 across the 3 of their papers we have counts for
4 papers
Quantum Pessiland
Boyang Chen, Tomoyuki Morimae, Takashi Yamakawa
Pessiland is a world where NP is hard on average but one-way functions (OWFs) do not exist [Impagliazzo 1995]. Because almost all classical cryptographic primitives imply OWFs [Imp…
No linear stretching of single-copy quantum pseudorandomness
Boyang Chen, Andrea Coladangelo, Yao-Ting Lin +3
Pseudorandom states, introduced by Ji, Liu, and Song (CRYPTO 2018), are quantum analogues of classical pseudorandom generators. A fundamental property of classical pseudorandom gen…
A Meta-Complexity Characterization of Minimal Quantum Cryptography
Bruno Cavalar, Boyang Chen, Andrea Coladangelo +4
We give a meta-complexity characterization of EFI pairs, which are considered the "minimal" primitive in quantum cryptography (and are equivalent to quantum commitments). More prec…
The power of a single Haar random state: constructing and separating quantum pseudorandomness
Boyang Chen, Andrea Coladangelo, Or Sattath
In this work, we focus on the following question: what are the cryptographic implications of having access to an oracle that provides a single Haar random quantum state? We find th…