Discrete logarithm problems with auxiliary inputs
From MaRDI portal
Publication:5962223
Recommendations
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- A new approach to the discrete logarithm problem with auxiliary inputs
- On the discrete logarithm problem
- The discrete logarithm problem
- scientific article; zbMATH DE number 3863322
- scientific article; zbMATH DE number 4214161
- The Discrete Logarithm problem with preprocessing
- Computing discrete logarithms
- Solvability of the problem of taking the discrete logarithm
Cites work
- scientific article; zbMATH DE number 1583767 (Why is no real title available?)
- scientific article; zbMATH DE number 989379 (Why is no real title available?)
- scientific article; zbMATH DE number 3167868 (Why is no real title available?)
- scientific article; zbMATH DE number 1186971 (Why is no real title available?)
- scientific article; zbMATH DE number 1088922 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 2204782 (Why is no real title available?)
- scientific article; zbMATH DE number 4187705 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Complexity of a determinate algorithm for the discrete logarithm
- Cryptography and Coding
- Explicit Bounds for Primality Testing and Related Problems
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Kangaroos, monopoly and discrete logarithms
- Monte Carlo Methods for Index Computation (mod p)
- On finding primitive roots in finite fields
- Pairings for cryptographers
- Public Key Cryptography - PKC 2005
- Remarks on Cheon’s Algorithms for Pairing-Related Problems
- Searching for Primitive Roots in Finite Fields
- Security Analysis of the Strong Diffie-Hellman Problem
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Strong Primes are Easy to Find
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- The Uber-Assumption Family
- The distribution of integers with a divisor in a given interval
- Theory of Cryptography
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
Cited in
(28)- Remarks on Cheon’s Algorithms for Pairing-Related Problems
- How to solve DLOG problem with auxiliary input
- scientific article; zbMATH DE number 1722682 (Why is no real title available?)
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- Verifiable random functions with optimal tightness
- A survey of elliptic curves for proof systems
- A group action on \({\mathbb Z}_p^{\times}\) and the generalized DLP with auxiliary inputs
- Research on attacking a special elliptic curve discrete logarithm problem
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- A new approach to the discrete logarithm problem with auxiliary inputs
- scientific article; zbMATH DE number 1424189 (Why is no real title available?)
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- Discrete logarithm problem using index calculus method
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- Compact hierarchical identity-based encryption based on a Harder decisional problem
- scientific article; zbMATH DE number 3863322 (Why is no real title available?)
- Finding elliptic curves with a subgroup of prescribed size
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime
- The discrete logarithm problem for exponents of bounded height
- Generic models for group actions
- PRE: stronger security notions and efficient construction with non-interactive opening
- scientific article; zbMATH DE number 4214161 (Why is no real title available?)
- Distribution and polynomial interpolation of the Dodis-Yampolskiy pseudo-random function
- Recent progress on the elliptic curve discrete logarithm problem
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- A fully-constructive discrete-logarithm preprocessing algorithm with an optimal time-space tradeoff
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
This page was built for publication: Discrete logarithm problems with auxiliary inputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962223)
