4 citations · 10 across the 15 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
quant-ph2022★ 4 cited
The NISQ Complexity of Collision Finding
Yassine Hamoudi, Qipeng Liu, Makrand Sinha
Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that there is no efficient way to find distinct inputs that produce the same hash value. This p…
quant-ph2022★ 1 cited
Non-uniformity and Quantum Advice in the Quantum Random Oracle Model
Qipeng Liu
QROM (quantum random oracle model), introduced by Boneh et al. (Asiacrypt 2011), captures all generic algorithms. However, it fails to describe non-uniform quantum algorithms with…
cs.CR2022
On the Feasibility of Unclonable Encryption, and More
Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li +2
Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) can…