On the public citation graph
Lower bounds on generic algorithms in groups
0 signed · 66 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-34799-2_38openalex-snapshot
Diffie-Hellman is as Strong as Discrete Log for Certain Primes
inferredcites →https://doi.org/10.1007/3-540-48658-5_26openalex-snapshot
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
inferredcites →https://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferredcites →https://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferredcites →https://doi.org/10.1007/978-1-4615-3198-2openalex-snapshot
Elliptic Curve Public Key Cryptosystems
inferredcites →https://doi.org/10.1090/psapm/042/1095551openalex-snapshot
The discrete logarithm problem
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot
An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
inferredcites →https://doi.org/10.1137/s0097539796302749openalex-snapshot
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11586821_1openalex-snapshot
Abstract Models of Computation in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-36288-6_23openalex-snapshot
The Security of DSA and ECDSA
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_16openalex-snapshot
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_19openalex-snapshot
Generic Algorithms and Key Agreement Protocols Based on Group Actions
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_17openalex-snapshot
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_9openalex-snapshot
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_4openalex-snapshot
On Instantiating the Algebraic Group Model from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_6openalex-snapshot
Generic-Group Delay Functions Require Hidden-Order Groups
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_17openalex-snapshot
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-64378-2_4openalex-snapshot
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_9openalex-snapshot
The “Quantum Annoying” Property of Password-Authenticated Key Exchange Protocols
inferred← citeshttps://doi.org/10.1007/978-3-030-92075-3_13openalex-snapshot
On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups
inferred← citeshttps://doi.org/10.1007/978-3-031-68379-4_9openalex-snapshot
Fine-Grained Non-interactive Key Exchange, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_20openalex-snapshot
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_2openalex-snapshot
The Algebraic Group Model and its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_58openalex-snapshot
Arithmetic Circuits for Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30539-2_27openalex-snapshot
On the Security of MOR Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_28openalex-snapshot
Variations of Diffie-Hellman Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_36openalex-snapshot
On Black-Box Ring Extraction and Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_21openalex-snapshot
Communication Complexity in Algebraic Two-Party Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-88733-1_14openalex-snapshot
On the Equivalence of Generic Group Models
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_24openalex-snapshot
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_33openalex-snapshot
Efficiency Limitations for Σ-Protocols for Group Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_2openalex-snapshot
Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-25261-7_1openalex-snapshot
Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_13openalex-snapshot
Applications of Arithmetical Geometry to Cryptographic Constructions
inferred← citeshttps://doi.org/10.1007/bfb0054018openalex-snapshot
On the security of server-aided RSA protocols
inferred← citeshttps://doi.org/10.1007/s00145-012-9120-yopenalex-snapshot
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
inferred← citeshttps://doi.org/10.1007/s00200-006-0005-xopenalex-snapshot
Homomorphic Public-Key Cryptosystems and Encrypting Boolean Circuits
inferred← citeshttps://doi.org/10.1007/s00224-014-9545-9openalex-snapshot
Cryptography and Algorithmic Randomness
inferred← citeshttps://doi.org/10.1007/s10623-003-6154-zopenalex-snapshot
Generic Groups, Collision Resistance, and ECDSA
inferred← citeshttps://doi.org/10.1007/s10958-005-0068-4openalex-snapshot
Public-key cryptography and invariant theory
inferred← citeshttps://doi.org/10.1007/s10958-005-0077-3openalex-snapshot
On non-Abelian homomorphic public-key cryptosystems
inferred← citeshttps://doi.org/10.1016/j.jco.2004.01.002openalex-snapshot
On the complexity of the discrete logarithm and Diffie–Hellman problems
inferred← citeshttps://doi.org/10.1017/s0004972700019547openalex-snapshot
Polynomial representations of the Diffie-Hellman mapping
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1109/isit.1998.708932openalex-snapshot
Diffie-Hellman, decision Diffie-Hellman, and discrete logarithms
inferred← citeshttps://doi.org/10.1109/ojcs.2020.3008961openalex-snapshot
Leakage-Resilient Certificate-based Key Encapsulation Scheme Resistant to Continual Leakage
inferred← citeshttps://doi.org/10.1137/110858835openalex-snapshot
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
inferred← citeshttps://doi.org/10.1137/s0097539796302749openalex-snapshot
The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
inferred← citeshttps://doi.org/10.1145/2976749.2978350openalex-snapshot
Identity-Concealed Authenticated Encryption and Key Exchange
inferred← citeshttps://doi.org/10.1145/2976749.2978413openalex-snapshot
On the Provable Security of (EC)DSA Signatures
inferred← citeshttps://doi.org/10.1145/3321705.3329826openalex-snapshot
Practical Aggregate Signature from General Elliptic Curves, and Applications to Blockchain
inferred← citeshttps://doi.org/10.1515/jmc.2009.004openalex-snapshot
Hash function requirements for Schnorr signatures
inferred← citeshttps://doi.org/10.1587/transfun.2019cip0018openalex-snapshot
A Setup-Free Threshold Encryption Scheme for the Bitcoin Protocol and Its Applications
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.1136openalex-snapshot
Identification Schemes from Key Encapsulation Mechanisms
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1802openalex-snapshot
Fusion Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0207080openalex-snapshot
Public-key cryptography and invariant theory
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0301022openalex-snapshot
Homomorphic public-key cryptosystems and encrypting boolean circuits
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309010openalex-snapshot
Homomorphic public-key cryptosystems over groups and rings
inferred← citeshttps://doi.org/10.5755/j01.itc.47.2.17847openalex-snapshot
Leakage-Resilient Certificateless Signature Under Continual Leakage Model
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.