A classification of computational assumptions in the algebraic group model
type: Item
instance of: scholarly article
title: A classification of computational assumptions in the algebraic group model
zbMATH Open document ID: 1504.94101
DOI: 10.1007/978-3-030-56880-1_5
author: Balthazar Bauer
author: Georg Fuchsbauer
author: Julian Loss
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614565
zbMATH Keywords: algebraic group model
zbMATH Keywords: Boyen's Uber assumption
zbMATH Keywords: pairing-based cryptography
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 5
OpenAlex ID: W3046337615
cites work: On instantiating the algebraic group model from falsifiable assumptions
cites work: Short signatures without random oracles and the SDH assumption in bilinear groups
cites work: Hierarchical Identity Based Encryption with Constant Size Ciphertext
cites work: Separation Results on the “One-More” Computational Problems
cites work: The distinction between fixed and random generators in group-based assumptions
cites work: The Uber-Assumption Family
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
cites work: Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
cites work: A probabilistic remark on algebraic program testing
cites work: The algebraic group model and its applications
cites work: Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
cites work: Towards a classification of non-interactive computational assumptions in cyclic groups
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Q4949336
cites work: Cryptography and Coding
cites work: Tight reductions for Diffie-Hellman variants in the algebraic group model
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: Q2724585
cites work: Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Recommended article: An analysis of the algebraic group model
Recommended article: Q3676344
Recommended article: The algebraic group model and its applications
Recommended article: Model-theoretic and algorithmic questions in group theory
Recommended article: On instantiating the algebraic group model from falsifiable assumptions
Recommended article: Q3588711
Recommended article: Q4226368
Recommended article: Towards a classification of non-interactive computational assumptions in cyclic groups
Recommended article: Algorithmic invariant theory of nonreductive groups
Recommended article: Computing in Unipotent and Reductive Algebraic Groups
description: scientific article; zbMATH DE number 7614565