Cryptology ePrint Archive: Report 2021/240

The Relationship Between Idealized Models Under Computationally Bounded Adversaries

Mark Zhandry and Cong Zhang

Abstract: The random oracle, generic group, and generic bilinear map models (ROM, GGM, GBM, respectively) are fundamental heuristics used to justify new computational assumptions and prove the security of efficient cryptosystems. While known to be invalid in some contrived settings, the heuristics generally seem reasonable for real-world applications.

In this work, we ask: \emph{which heuristics are closer to reality?} Or conversely, which heuristics are a larger leap? We answer this question through the framework of computational indifferentiability, showing that the ROM is a strictly ``milder'' heuristic than the GGM, which in turn is strictly milder than the GBM. While this may seem like the expected outcome, we explain why it does not follow from prior works and is not the a priori obvious conclusion. In order to prove our results, we develop new ideas for proving computational indifferentiable separations.

Category / Keywords: foundations / Indifferentiability, , Random oracle model, Generic Group Model

Date: received 1 Mar 2021

Contact author: congresearch at gmail com, czhang20 at umd edu, mzhandry at princeton edu

Available format(s): PDF | BibTeX Citation

Version: 20210302:204035 (All versions of this report)

Short URL: ia.cr/2021/240


[ Cryptology ePrint archive ]