Discrete logarithm problems with auxiliary inputs
From MaRDI portal
Publication:5962223
DOI10.1007/s00145-009-9047-0zbMath1195.94052MaRDI QIDQ5962223
Publication date: 21 September 2010
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-009-9047-0
discrete logarithm; auxiliary inputs; baby-step giant-step; blind signature; ElGamal encryption; Pollard's kangaroo algorithm; strong Diffie-Hellman
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Compact hierarchical identity-based encryption based on a harder decisional problem, Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Recent progress on the elliptic curve discrete logarithm problem, Research on attacking a special elliptic curve discrete logarithm problem, PRE: stronger security notions and efficient construction with non-interactive opening, Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime, Short signatures from Diffie-Hellman: realizing almost compact public key, Finding elliptic curves with a subgroup of prescribed size, A new approach to the discrete logarithm problem with auxiliary inputs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- On finding primitive roots in finite fields
- Kangaroos, monopoly and discrete logarithms
- Short signatures from the Weil pairing
- Complexity of a determinate algorithm for the discrete logarithm
- The distribution of integers with a divisor in a given interval
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Explicit Bounds for Primality Testing and Related Problems
- Security Analysis of the Strong Diffie-Hellman Problem
- The Uber-Assumption Family
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Strong Primes are Easy to Find
- Searching for Primitive Roots in Finite Fields
- Monte Carlo Methods for Index Computation (mod p)
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Remarks on Cheon’s Algorithms for Pairing-Related Problems
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Public Key Cryptography - PKC 2005
- Cryptography and Coding
- Theory of Cryptography
