Cryptography in the Common Haar State Model: Feasibility Results and Separations

ePrint Report: Cryptography in the Common Haar State Model: Feasibility Results and Separations

Prabhanjan Ananth, Aditya Gulati, Yao-Ting Lin

Common random string model is a popular model in classical cryptography. We study a quantum analogue of this model called the common Haar state (CHS) model. In this model, every party participating in the cryptographic system receives many copies of one or more i.i.d Haar random states.


We study feasibility and limitations of cryptographic primitives in this model and its variants: …

called chs cryptography eprint report popular quantum random report results state study