Paper 2024/543

A Note on the Common Haar State Model

Prabhanjan Ananth, University of California, Santa Barbara
Aditya Gulati, University of California, Santa Barbara
Yao-Ting Lin, University of California, Santa Barbara
Abstract

Common random string model is a popular model in classical cryptography with many constructions proposed in this model. We study a quantum analogue of this model called the common Haar state model, which was also studied in an independent work by Chen, Coladangelo and Sattath (arXiv 2024). In this model, every party in the cryptographic system receives many copies of one or more i.i.d Haar states. Our main result is the construction of a statistically secure PRSG with: (a) the output length of the PRSG is strictly larger than the key size, (b) the security holds even if the adversary receives $O\left(\frac{\lambda}{(\log(\lambda))^{1.01}} \right)$ copies of the pseudorandom state. We show the optimality of our construction by showing a matching lower bound. Our construction is simple and its analysis uses elementary techniques.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Quantum cryptography
Contact author(s)
prabhanjan @ cs ucsb edu
adityagulati @ ucsb edu
yao-ting_lin @ ucsb edu
History
2024-04-08: approved
2024-04-08: received
See all versions
Short URL
https://ia.cr/2024/543
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/543,
      author = {Prabhanjan Ananth and Aditya Gulati and Yao-Ting Lin},
      title = {A Note on the Common Haar State Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/543},
      year = {2024},
      url = {https://eprint.iacr.org/2024/543}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.