A classification of computational assumptions in the algebraic group model

DOI10.1007/978-3-030-56880-1_5zbMath1504.94101OpenAlexW3046337615MaRDI QIDQ2096519

Georg Fuchsbauer, Julian Loss, Balthazar Bauer

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56880-1_5

zbMATH Keywords

pairing-based cryptographyalgebraic group modelBoyen's Uber assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (14)

A fast and simple partially oblivious PRF, with applications ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Generic models for group actions ⋮ Revisiting BBS signatures ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Counting vampires: from univariate sumcheck to updatable ZK-SNARK ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Snarky ceremonies ⋮ Algebraic adversaries in the universal composability framework ⋮ To label, or not to label (in generic groups) ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ An analysis of the algebraic group model ⋮ Practical dynamic group signatures without knowledge extractors

Cites Work

• Unnamed Item
• Unnamed Item
• A probabilistic remark on algebraic program testing
• Towards a classification of non-interactive computational assumptions in cyclic groups
• The algebraic group model and its applications
• Complexity of a determinate algorithm for the discrete logarithm
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• On instantiating the algebraic group model from falsifiable assumptions
• Tight reductions for Diffie-Hellman variants in the algebraic group model
• The distinction between fixed and random generators in group-based assumptions
• Short signatures without random oracles and the SDH assumption in bilinear groups
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The Uber-Assumption Family
• Advances in Cryptology – CRYPTO 2004
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Separation Results on the “One-More” Computational Problems
• On the Size of Pairing-Based Non-interactive Arguments
• Cryptography and Coding

This page was built for publication: A classification of computational assumptions in the algebraic group model