Cryptology ePrint Archive: Report 2020/859

A Classification of Computational Assumptions in the Algebraic Group Model

Balthazar Bauer and Georg Fuchsbauer and Julian Loss

Abstract: We give a taxonomy of computational assumptions in the algebraic group model (AGM). We first analyze Boyen's Uber assumption family for bilinear groups and then extend it in several ways to cover assumptions as diverse as Gap Diffie-Hellman and LRSW. We show that in the AGM every member of these families is implied by the $q$-discrete logarithm (DL) assumption, for some $q$ that depends on the degrees of the polynomials defining the Uber assumption.

Using the meta-reduction technique, we then separate $(q+1)$-DL from $q$-DL, which yields a classification of all members of the extended Uber-assumption families. We finally show that there are strong assumptions, such as one-more DL, that provably fall outside our classification, by proving that they cannot be reduced from $q$-DL even in the AGM.

Category / Keywords: foundations / Algebraic Group Model, Uber Assumption, Pairing-Based Cryptography

Original Publication (with major differences): IACR-CRYPTO-2020

Date: received 9 Jul 2020

Contact author: balthazar bauer at ens fr

Available format(s): PDF | BibTeX Citation

Version: 20200712:125028 (All versions of this report)

Short URL: ia.cr/2020/859


[ Cryptology ePrint archive ]