On the public citation graph
Complexity of a determinate algorithm for the discrete logarithm
0 signed · 198 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.1017/cbo9781139172769openalex-snapshot
Introduction to Finite Fields and their Applications
inferredcites →https://doi.org/10.1090/pspum/020/0316385openalex-snapshot
Class number, a theory of factorization, and genera
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.1109/tit.1984.1056941openalex-snapshot
Fast evaluation of logarithms in fields of characteristic two
inferredcites →https://doi.org/10.1137/0605029openalex-snapshot
Computing Logarithms in Finite Fields of Characteristic Two
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.10033openalex-snapshot
Slope packings and coverings, and generic algorithms for the discrete logarithm problem
inferred← citeshttps://doi.org/10.1007/11523468_106openalex-snapshot
Quantum Complexity of Testing Group Commutativity
inferred← citeshttps://doi.org/10.1007/11555827_9openalex-snapshot
Machine-Checked Security Proofs of Cryptographic Signature Schemes
inferred← citeshttps://doi.org/10.1007/11586821_1openalex-snapshot
Abstract Models of Computation in Cryptography
inferred← citeshttps://doi.org/10.1007/11617990_3openalex-snapshot
A Machine-Checked Formalization of the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/11734727_32openalex-snapshot
An Efficient Static Blind Ring Signature Scheme
inferred← citeshttps://doi.org/10.1007/11751595_38openalex-snapshot
Efficient Partially Blind Signatures with Provable Security
inferred← citeshttps://doi.org/10.1007/11792086_41openalex-snapshot
Hard Instances of the Constrained Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/11935230_16openalex-snapshot
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_28openalex-snapshot
Why Provable Security Matters?
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_35openalex-snapshot
A Note on Security Proofs in the Generic Model
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_7openalex-snapshot
Security of Signed ElGamal Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_8openalex-snapshot
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
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-45600-7_1openalex-snapshot
Security of Blind Discrete Log Signatures against Interactive Attacks
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-45708-9_19openalex-snapshot
A Generalized Birthday Problem
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_7openalex-snapshot
Flaws in Applying Proof Methodologies to Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_1openalex-snapshot
Practical Security in Public-Key Cryptography
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/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_18openalex-snapshot
Lower Bounds for Discrete Logarithms and Related Problems
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_4openalex-snapshot
Provable Security for Public Key Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4613-0283-4_8openalex-snapshot
A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_3openalex-snapshot
Discrete Logarithms: The Past and the Future
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-26951-7_27openalex-snapshot
The Distinction Between Fixed and Random Generators in Group-Based Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-34618-8_17openalex-snapshot
Public-Key Function-Private Hidden Vector Encryption (and More)
inferred← citeshttps://doi.org/10.1007/978-3-030-36033-7_20openalex-snapshot
On the (In)security of Kilian-Based SNARGs
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_3openalex-snapshot
Blind Schnorr Signatures and Signed ElGamal Encryption 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-56784-2_26openalex-snapshot
On Succinct Arguments and Witness Encryption from 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-56880-1_5openalex-snapshot
A Classification of Computational Assumptions in the Algebraic Group Model
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-64381-2_13openalex-snapshot
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-84259-8_12openalex-snapshot
Does Fiat-Shamir Require a Cryptographic Hash Function?
inferred← citeshttps://doi.org/10.1007/978-3-030-92068-5_20openalex-snapshot
The One-More Discrete Logarithm Assumption in the Generic Group Model
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-030-92078-4_11openalex-snapshot
Algebraic Adversaries in the Universal Composability Framework
inferred← citeshttps://doi.org/10.1007/978-3-031-06944-4_13openalex-snapshot
On the Security of ECDSA with Additive Key Derivation and Presignatures
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_21openalex-snapshot
On the Multi-user Security of Short Schnorr Signatures with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-031-15982-4_3openalex-snapshot
To Label, or Not To Label (in Generic Groups)
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_26openalex-snapshot
The Price of Verifiability: Lower Bounds for Verifiable Random Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-22368-6_8openalex-snapshot
Beyond Uber: Instantiating Generic Groups via PGGs
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_11openalex-snapshot
An Analysis of the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-031-49187-0_26openalex-snapshot
Function-Hiding Zero Predicate Inner Product Functional Encryption from Pairings
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_1openalex-snapshot
On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-58723-8_5openalex-snapshot
Concurrently Secure Blind Schnorr Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-78011-0_4openalex-snapshot
The Brave New World of Global Generic Groups and UC-Secure Zero-Overhead SNARKs
inferred← citeshttps://doi.org/10.1007/978-3-031-91098-2_13openalex-snapshot
A New Approach to Generic Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-031-91098-2_14openalex-snapshot
Fine-Grained Complexity in a World Without Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-032-01878-6_15openalex-snapshot
Quantum State Group Actions
inferred← citeshttps://doi.org/10.1007/978-3-032-01887-8_8openalex-snapshot
Schnorr Signatures are Tightly Secure in the ROM Under a Non-interactive Assumption
inferred← citeshttps://doi.org/10.1007/978-3-032-25330-9_4openalex-snapshot
The Structured Generic-Group Model
inferred← citeshttps://doi.org/10.1007/978-3-032-26734-4_3openalex-snapshot
Hashing in Generic Groups: Completing the AGM-to-GGM Transfer
inferred← citeshttps://doi.org/10.1007/978-3-032-35424-2_5openalex-snapshot
Pairing-Based SNARGs with Two Group Elements
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_5openalex-snapshot
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-61204-1_17openalex-snapshot
Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
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-70697-9_3openalex-snapshot
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-70700-6_1openalex-snapshot
A Subversion-Resistant SNARK
inferred← citeshttps://doi.org/10.1007/978-3-319-78375-8_14openalex-snapshot
The Discrete-Logarithm Problem with Preprocessing
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-319-98113-0_29openalex-snapshot
Function-Hiding Inner Product Encryption Is Practical
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_29openalex-snapshot
A Machine-Checked Formalization of the Generic Model and the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-540-30496-8_8openalex-snapshot
Blind Spontaneous Anonymous Group Signatures for Ad Hoc Groups
inferred← citeshttps://doi.org/10.1007/978-3-540-30574-3_21openalex-snapshot
Fast and Proven Secure Blind Identity-Based Signcryption from Pairings
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_30openalex-snapshot
Selecting Cryptographic Key Sizes
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_22openalex-snapshot
Attribute-Based Broadcast Encryption Scheme Made Efficient
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-70936-7_5openalex-snapshot
Parallel Repetition of Computationally Sound Protocols Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-70936-7_7openalex-snapshot
Perfect NIZK with Adaptive Soundness
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_19openalex-snapshot
Chosen-Ciphertext Secure Key-Encapsulation Based on Gap Hashed Diffie-Hellman
inferred← citeshttps://doi.org/10.1007/978-3-540-72163-5_25openalex-snapshot
Identity-Based Threshold Decryption Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_31openalex-snapshot
Gradually Convertible Undeniable Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-74484-9_96openalex-snapshot
Efficient Partially Blind Signatures with Provable Security
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_9openalex-snapshot
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
inferred← citeshttps://doi.org/10.1007/978-3-540-85538-5_3openalex-snapshot
The Uber-Assumption Family
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-540-89255-7_30openalex-snapshot
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_2openalex-snapshot
Breaking RSA Generically Is Equivalent to Factoring
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-17373-8_34openalex-snapshot
Leakage Resilient ElGamal Encryption
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_37openalex-snapshot
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-28914-9_7openalex-snapshot
On the Instantiability of Hash-and-Sign RSA Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-34931-7_19openalex-snapshot
Computing Small Discrete Logarithms Faster
inferred← citeshttps://doi.org/10.1007/978-3-642-35840-1_9openalex-snapshot
Efficient Identity-Based and Authenticated Key Agreement Protocol
inferred← citeshttps://doi.org/10.1007/978-3-642-36095-4_20openalex-snapshot
The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_6openalex-snapshot
Automated Analysis of Cryptographic Assumptions in Generic Group Models
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_35openalex-snapshot
On the Practical Security of Inner Product Functional Encryption
inferred← citeshttps://doi.org/10.1007/978-3-662-46803-6_27openalex-snapshot
Generic Hardness of the Multiple Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_11openalex-snapshot
Efficient Fully Structure-Preserving Signatures for Large Messages
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_29openalex-snapshot
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
inferred← citeshttps://doi.org/10.1007/978-981-15-8711-5_4openalex-snapshot
Impact of Computational Power on Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-95-5116-3_9openalex-snapshot
Laconic PSI on Authenticated Inputs and Applications
inferred← citeshttps://doi.org/10.1007/978-981-96-0888-1_1openalex-snapshot
On Security Proofs of Existing Equivalence Class Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-981-96-0941-3_1openalex-snapshot
On the Complexity of Cryptographic Groups and Generic Group Models
inferred← citeshttps://doi.org/10.1007/bfb0054018openalex-snapshot
On the security of server-aided RSA protocols
inferred← citeshttps://doi.org/10.1007/bfb0054129openalex-snapshot
Speeding up discrete log and factoring based schemes via precomputations
inferred← citeshttps://doi.org/10.1007/bfb0054851openalex-snapshot
The Decision Diffie-Hellman problem
inferred← citeshttps://doi.org/10.1007/s00145-001-0009-4openalex-snapshot
Selecting Cryptographic Key Sizes
inferred← citeshttps://doi.org/10.1007/s00145-009-9047-0openalex-snapshot
Discrete Logarithm Problems with Auxiliary Inputs
inferred← citeshttps://doi.org/10.1007/s00145-010-9090-xopenalex-snapshot
Parallel Repetition of Computationally Sound Protocols Revisited
inferred← citeshttps://doi.org/10.1007/s00145-012-9119-4openalex-snapshot
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
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/s00145-018-9300-5openalex-snapshot
Efficient Fully Structure-Preserving Signatures and Shrinking Commitments
inferred← citeshttps://doi.org/10.1007/s00145-018-9302-3openalex-snapshot
Automated Analysis of Cryptographic Assumptions in Generic Group Models
inferred← citeshttps://doi.org/10.1007/s00145-021-09379-yopenalex-snapshot
On Subversion-Resistant SNARKs
inferred← citeshttps://doi.org/10.1007/s001459900039openalex-snapshot
The Black-Box Model for Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/s10207-023-00750-7openalex-snapshot
Simulation extractable versions of Groth’s zk-SNARK revisited
inferred← citeshttps://doi.org/10.1007/s10623-003-6154-zopenalex-snapshot
Generic Groups, Collision Resistance, and ECDSA
inferred← citeshttps://doi.org/10.1007/s10623-015-0146-7openalex-snapshot
Recent progress on the elliptic curve discrete logarithm problem
inferred← citeshttps://doi.org/10.1007/s10623-023-01237-1openalex-snapshot
On the security of functional encryption in the generic group model
inferred← citeshttps://doi.org/10.1007/s10916-010-9595-8openalex-snapshot
A Study on Agent-Based Secure Scheme for Electronic Medical Record System
inferred← citeshttps://doi.org/10.1007/s10916-011-9716-zopenalex-snapshot
Deployment of Secure Mobile Agents for Medical Information Systems
inferred← citeshttps://doi.org/10.1007/s11390-007-9102-yopenalex-snapshot
Short Group Signatures Without Random Oracles
inferred← citeshttps://doi.org/10.1007/s11390-024-3670-yopenalex-snapshot
Efficient Function-Hiding Inner Product Functional Encryption and Its Application to Fine-Grained Data Sharing
inferred← citeshttps://doi.org/10.1007/s11565-007-0021-1openalex-snapshot
Cryptosystems based on semi-distributive algebras
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.001openalex-snapshot
Algebraic curves and cryptography
inferred← citeshttps://doi.org/10.1016/j.ins.2005.04.007openalex-snapshot
Enhancing the security of perfect blind DL-signatures
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.1016/j.jsc.2017.07.003openalex-snapshot
Baby-step giant-step algorithms for the symmetric group
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.03.009openalex-snapshot
Generic hardness of inversion on ring and its relation to self-bilinear map
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00173-3openalex-snapshot
Small generic hardcore subsets for the discrete logarithm: Short secret DL-keys
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.003openalex-snapshot
Inside Our Computable World, and the Mathematics of Universality
inferred← citeshttps://doi.org/10.1017/cbo9780511863196.007openalex-snapshot
Cryptography and Computation after Turing
inferred← citeshttps://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferred← citeshttps://doi.org/10.1080/00207160.2010.543951openalex-snapshot
Towards a security model for computational puzzle schemes
inferred← citeshttps://doi.org/10.1080/09720529.2015.1084782openalex-snapshot
On improvements of ther-adding walk in a finite field of characteristic 2
inferred← citeshttps://doi.org/10.1090/conm/461/08988openalex-snapshot
Discrete logarithms in curves over finite fields
inferred← citeshttps://doi.org/10.1090/conm/518/10212openalex-snapshot
Intractable problems in cryptography
inferred← citeshttps://doi.org/10.1109/cis.2013.102openalex-snapshot
Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00057openalex-snapshot
Dot-Product Proofs and Their Applications
inferred← citeshttps://doi.org/10.1109/icbctis66509.2025.11387320openalex-snapshot
A Certificateless Authentication Scheme Based on Zero-Divisor Graph for IoT
inferred← citeshttps://doi.org/10.1109/icfcc.2010.5497804openalex-snapshot
Automated security proof of the ElGamal encryption scheme
inferred← citeshttps://doi.org/10.1109/jiot.2025.3580177openalex-snapshot
A Multiparty Authentication Scheme Based on Aggregate Certificateless Signature for Smart Healthcare
inferred← citeshttps://doi.org/10.1109/jiot.2025.3646729openalex-snapshot
Optimizing Attribute-Based Encryption for Fine-Grained Access Control in Cloud Environments: An Adaptively Secure, Offline/Online, and Outsourcing Framework
inferred← citeshttps://doi.org/10.1109/surv.2013.111413.00196openalex-snapshot
Secure Device Pairing: A Survey
inferred← citeshttps://doi.org/10.1109/tit.2016.2594197openalex-snapshot
Breaking RSA Generically Is Equivalent to Factoring
inferred← citeshttps://doi.org/10.1109/tnet.2022.3141582openalex-snapshot
PPQC: A Blockchain-Based Privacy-Preserving Quality Control Mechanism in Crowdsensing Applications
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1145/1102120.1102134openalex-snapshot
Untraceable RFID tags via insubvertible encryption
inferred← citeshttps://doi.org/10.1145/2090236.2090263openalex-snapshot
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
inferred← citeshttps://doi.org/10.1145/2488608.2488623openalex-snapshot
Recursive composition and bootstrapping for SNARKS and proof-carrying data
inferred← citeshttps://doi.org/10.1145/3098243.3098258openalex-snapshot
Anonymous attestations made practical
inferred← citeshttps://doi.org/10.1145/3133956.3134088openalex-snapshot
Attribute-Based Encryption in the Generic Group Model
inferred← citeshttps://doi.org/10.1145/3488932.3497759openalex-snapshot
Symbolic Synthesis of Indifferentiability Attacks
inferred← citeshttps://doi.org/10.1145/3618260.3649605openalex-snapshot
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
inferred← citeshttps://doi.org/10.1145/3806201openalex-snapshot
SoK: Signatures With Randomization Features
inferred← citeshttps://doi.org/10.11591/ijeecs.v21.i3.pp1751-1758openalex-snapshot
Key exchange based on Diffie-Hellman protocol and image registration
inferred← citeshttps://doi.org/10.1587/transfun.2020cip0002openalex-snapshot
On a Relation between Knowledge-of-Exponent Assumptions and the DLog vs. CDH Question
inferred← citeshttps://doi.org/10.20431/2347-3142.1001001openalex-snapshot
Cryptanalyse des fonctions a sens Unique Exponentielle Modulaire a l'aide des Bases de Grobner
inferred← citeshttps://doi.org/10.20868/upm.thesis.53392openalex-snapshot
Automated Analysis of Cryptographic Constructions
inferred← citeshttps://doi.org/10.22028/d291-25727openalex-snapshot
Secure fingerprinting on sound foundations
inferred← citeshttps://doi.org/10.22042/isecure.2013.5.1.3openalex-snapshot
Design and formal verification of DZMBE
inferred← citeshttps://doi.org/10.2478/popets-2021-0003openalex-snapshot
Controlled Functional Encryption Revisited: Multi-Authority Extensions and Efficient Schemes for Quadratic Functions
inferred← citeshttps://doi.org/10.26636/jtit.2002.4.146openalex-snapshot
Asymmetric cryptography and practical security
inferred← citeshttps://doi.org/10.35940/ijeat.e4153.0612523openalex-snapshot
Quantum Computers and Algorithms: A Threat to Classical Cryptographic Systems
inferred← citeshttps://doi.org/10.3929/ethz-a-007242748openalex-snapshot
Security proofs in number theoretic cryptography
inferred← citeshttps://doi.org/10.3934/amc.2017038openalex-snapshot
Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
inferred← citeshttps://doi.org/10.4036/iis.2019.r.03openalex-snapshot
On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups
inferred← citeshttps://doi.org/10.4213/mvk260openalex-snapshot
On the security properties of Russian standardized elliptic curves
inferred← citeshttps://doi.org/10.4236/ijcns.2010.37077openalex-snapshot
Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements
inferred← citeshttps://doi.org/10.48550/arxiv.1207.5438openalex-snapshot
Efficient Identity-Based and Authenticated Key Agreement Protocol
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3719openalex-snapshot
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
inferred← citeshttps://doi.org/10.48550/arxiv.1601.04134openalex-snapshot
On improvements of the $r$-adding walk in a finite field of characteristic 2
inferred← citeshttps://doi.org/10.48550/arxiv.1612.03456openalex-snapshot
Baby-Step Giant-Step Algorithms for the Symmetric Group
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10214openalex-snapshot
Partially Encrypted Machine Learning using Functional Encryption
inferred← citeshttps://doi.org/10.48550/arxiv.math/0606771openalex-snapshot
Hard Instances of the Constrained Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0506265openalex-snapshot
Quantum Complexity of Testing Group Commutativity
inferred← citeshttps://doi.org/10.5802/ccirm.21openalex-snapshot
Integer factorization and discrete logarithm problems
inferred← citeshttps://doi.org/10.62056/a0l2i888openalex-snapshot
A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function
inferred← citeshttps://doi.org/10.62056/anr-zoja5openalex-snapshot
The Uber-Knowledge Assumption: A Bridge to the AGM
inferred← citeshttps://doi.org/10.70675/03e70022z3b51z4264z86ffz300c571650d3openalex-snapshot
Discrete Logarithm Cryptanalyses : Number Field Sieve and Lattice Tools for Side-Channel Attacks
inferred← citeshttps://doi.org/10.70675/116140dbza9a5z49d5zaa7ezfbd3f8f1cf51openalex-snapshot
Constrained Pseudorandom Functions : New Constructions and Connections with Secure Computation
inferred← citeshttps://doi.org/10.70675/196b5530z3b09z4e13z8ec5zbc53bdad6b5eopenalex-snapshot
Cryptography for privacy-preserving machine learning
inferred← citeshttps://doi.org/10.70675/6422f682z1cfcz4b0az9c19z5af57add59feopenalex-snapshot
Conception de mécanismes d'accréditations anonymes et d'anonymisation de données
inferred← citeshttps://doi.org/10.70675/64ae50fez53b8z4152zb19fz8380fc8e40d6openalex-snapshot
Counting points on hyperelliptic curves in large characteristic : algorithms and complexity
inferred← citeshttps://doi.org/10.70675/67ef963ez859az430czbf2az23a0bd38ab13openalex-snapshot
Transferable e-cash : an analysis in the algebraic group model
inferred← citeshttps://doi.org/10.70675/6eb45a24z8757z4c61za4eez93f26adb3bcaopenalex-snapshot
The security of the one-more discrete-logarithm assumption and blind Schnorr signatures
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/a794b49ez69b5z4e89z8619zfbe754ad9170openalex-snapshot
The Phantom Thread Between Malleable and Non-Malleable Cryptography
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.