Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups

DOI10.4230/LIPICS.ITC.2022.13MaRDI QIDQ6561694zbMATH OpenFDO

Authors Lior Rotem

Publication date 25 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2022.13

zbMATH Keywords

algebraic group modelbilinear groupshidden-order groupsUber assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A classification of computational assumptions in the algebraic group model
• The algebraic group model and its applications
• Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions
• Beyond Uber: instantiating generic groups via PGGs
• The Uber-Assumption Family

Cited in

(7)

• Generalised asynchronous remote key generation for pairing-based cryptosystems
• Algebraic group model with oblivious sampling
• Accountability for misbehavior in threshold decryption via threshold traitor tracing
• Breaking RSA generically is equivalent to factoring, with preprocessing
• A complete characterization of one-more assumptions in the algebraic group model
• Traceable threshold encryption without a trusted dealer
• Revisiting discrete logarithm reductions

This page was built for publication: Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups

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