Revisiting discrete logarithm reductions

DOI10.62056/A0C3C3C2HMaRDI QIDQ7346689zbMATH OpenFDO

Authors Maiara F. Bollauf, Roberto Parisella, Janno Siim

Publication date 11 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0C3C3C2H

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A classification of computational assumptions in the algebraic group model
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Algebraic group model with oblivious sampling
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Constant-Size Commitments to Polynomials and Their Applications
• Constant-size zk-SNARKs in ROM from falsifiable assumptions
• Cryptography and Coding
• Cryptography and Coding
• Diffie-Hellman Oracles
• Fair Exchange of Short Signatures without Trusted Third Party
• Generic and algebraic computation models: when AGM proofs transfer to the GGM
• Hierarchical Identity Based Encryption with Constant Size Ciphertext
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 1406786 (Why is no real title available?)
• scientific article; zbMATH DE number 4187705 (Why is no real title available?)
• Pairing-Friendly Elliptic Curves of Prime Order
• Practical homomorphic MACs for arithmetic circuits
• Public Key Cryptography – PKC 2004
• Revisiting BBS signatures
• Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
• Security Analysis of the Strong Diffie-Hellman Problem
• The algebraic group model and its applications
• The Equivalence between the DHP and DLP for Elliptic Curves Used in Practical Applications
• The joy of factoring
• The kernel matrix Diffie-Hellman assumption
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• The Uber-Assumption Family
• To label, or not to label (in generic groups)
• Towards a classification of non-interactive computational assumptions in cyclic groups

This page was built for publication: Revisiting discrete logarithm reductions

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