A classification of computational assumptions in the algebraic group model

DOI10.1007/978-3-030-56880-1_5MaRDI QIDQ2096519zbMATH OpenOpenAlexFDO

Authors Balthazar Bauer, Georg Fuchsbauer, Julian Loss

Publication date 9 November 2022

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

zbMATH Keywords

algebraic group modelBoyen's Uber assumptionpairing-based cryptography

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• An analysis of the algebraic group model
• scientific article; zbMATH DE number 3897215
• The algebraic group model and its applications
• Model-theoretic and algorithmic questions in group theory
• On instantiating the algebraic group model from falsifiable assumptions
• Computational algorithms in modular groupoids
• scientific article; zbMATH DE number 1245580
• Towards a classification of non-interactive computational assumptions in cyclic groups
• Algorithmic invariant theory of nonreductive groups
• Computing in unipotent and reductive algebraic groups.

Cites work

• A probabilistic remark on algebraic program testing
• Advances in Cryptology – CRYPTO 2004
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Complexity of a determinate algorithm for the discrete logarithm
• Cryptography and Coding
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
• Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
• Déjà Q: using dual systems to revisit \(q\)-type assumptions
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• scientific article; zbMATH DE number 1618043 (Why is no real title available?)
• scientific article; zbMATH DE number 1440890 (Why is no real title available?)
• On instantiating the algebraic group model from falsifiable assumptions
• On the size of pairing-based non-interactive arguments
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Separation Results on the “One-More” Computational Problems
• Short signatures without random oracles and the SDH assumption in bilinear groups
• The algebraic group model and its applications
• The distinction between fixed and random generators in group-based assumptions
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The Uber-Assumption Family
• Tight reductions for Diffie-Hellman variants in the algebraic group model
• Towards a classification of non-interactive computational assumptions in cyclic groups

Cited in

(41)

• Towards a classification of non-interactive computational assumptions in cyclic groups
• On instantiating the algebraic group model from falsifiable assumptions
• Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
• A fast and simple partially oblivious PRF, with applications
• Tight reductions for Diffie-Hellman variants in the algebraic group model
• Practical dynamic group signatures without knowledge extractors
• The Uber-Assumption Family
• 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
• Generalised asynchronous remote key generation for pairing-based cryptosystems
• Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
• Threshold structure-preserving signatures
• An efficient strong asymmetric PAKE compiler instantiable from group actions
• Rogue-instance security for batch knowledge proofs
• Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
• On the unforgeability of the Chaum-Pedersen blind signature scheme
• Generic and algebraic computation models: when AGM proofs transfer to the GGM
• Accountability for misbehavior in threshold decryption via threshold traitor tracing
• Commit-and-prove system for vectors and applications to threshold signing
• From one-time to two-round reusable multi-signatures without nested forking
• On security proofs of existing equivalence class signature schemes
• A complete characterization of one-more assumptions in the algebraic group model
• On the concrete security of BBS/BBS+ signatures
• Traceable threshold encryption without a trusted dealer
• Adaptively secure partially non-interactive threshold Schnorr signatures in the AGM
• Secure cloud storage: modularization, network adversaries and adaptive corruptions
• An explicit high-moment forking lemma and its applications to the concrete security of multi-signatures
• The uber-knowledge assumption: a bridge to the AGM
• \textsf{Boomy}: batch opening of multivariate polynomial commitment
• Revisiting discrete logarithm reductions
• Hashing in generic groups: completing the AGM-to-GGM transfer

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096519)