[Resource Topic] 2022/1441: Tighter Post-quantum Proof for Plain FDH, PFDH and GPV-IBE

Welcome to the resource topic for 2022/1441

Tighter Post-quantum Proof for Plain FDH, PFDH and GPV-IBE

Authors: Yu Liu, Haodong Jiang, Yunlei Zhao


In CRYPTO 2012, Zhandry developed generic semi-constant oracle technique and proved security of an identity-based encryption scheme, GPV-IBE, and full domain hash (FDH) signature scheme in the quantum random oracle model (QROM). However, the reduction provided by Zhandry incurred a quadratic reduction loss. In this work, we provide a much tighter proof, with linear reduntion loss, for the FDH, probabilistc FDH (PFDH), and GPV-IBE in the QROM. Our proof is based on the measure-and-reprogram technique developed by Don, Fehr, Majenz and Schaffner.

ePrint: https://eprint.iacr.org/2022/1441

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .