Discrete logarithm problems with auxiliary inputs
From MaRDI portal
Publication:5962223
DOI10.1007/S00145-009-9047-0zbMATH Open1195.94052OpenAlexW1985592521MaRDI QIDQ5962223FDOQ5962223
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
blind signaturediscrete logarithmElGamal encryptionauxiliary inputsbaby-step giant-stepstrong Diffie-HellmanPollard's kangaroo algorithm
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Short signatures from the Weil pairing
- The distribution of integers with a divisor in a given interval
- Short signatures without random oracles and the SDH assumption in bilinear groups
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Searching for Primitive Roots in Finite Fields
- Monte Carlo Methods for Index Computation (mod p)
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Pairings for cryptographers
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Theory of Cryptography
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- On finding primitive roots in finite fields
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Kangaroos, monopoly and discrete logarithms
- Strong Primes are Easy to Find
- Security Analysis of the Strong Diffie-Hellman Problem
- Cryptography and Coding
- Complexity of a determinate algorithm for the discrete logarithm
- Explicit Bounds for Primality Testing and Related Problems
- The Uber-Assumption Family
- Public Key Cryptography - PKC 2005
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Remarks on Cheon’s Algorithms for Pairing-Related Problems
Cited In (22)
- Recent progress on the elliptic curve discrete logarithm problem
- Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
- A new approach to the discrete logarithm problem with auxiliary inputs
- Short signatures from Diffie-Hellman: realizing almost compact public key
- PRE: stronger security notions and efficient construction with non-interactive opening
- Title not available (Why is that?)
- Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function
- Title not available (Why is that?)
- Discrete logarithm problem using index calculus method
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Compact hierarchical identity-based encryption based on a harder decisional problem
- A survey of elliptic curves for proof systems
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
- Title not available (Why is that?)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Verifiable random functions with optimal tightness
- Multiple Discrete Logarithm Problems with Auxiliary Inputs
- Finding elliptic curves with a subgroup of prescribed size
- Research on attacking a special elliptic curve discrete logarithm problem
- Counting fixed points and rooted closed walks of the singular map \(x \mapsto x^{x^n}\) modulo powers of a prime
- Generic models for group actions
Recommendations
- On the discrete logarithm problem 👍 👎
- The Discrete Logarithm Problem 👍 👎
- Computing Discrete Logarithms 👍 👎
- A new approach to the discrete logarithm problem with auxiliary inputs 👍 👎
- The Discrete Logarithm problem with preprocessing 👍 👎
- Multiple Discrete Logarithm Problems with Auxiliary Inputs 👍 👎
- Solvability of the problem of taking the discrete logarithm 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
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)
