Discrete logarithm problems with auxiliary inputs

DOI10.1007/s00145-009-9047-0zbMath1195.94052OpenAlexW1985592521MaRDI QIDQ5962223

Jung Hee Cheon

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

zbMATH Keywords

discrete logarithmauxiliary inputsbaby-step giant-stepblind signatureElGamal encryptionPollard's kangaroo algorithmstrong Diffie-Hellman

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (16)

Finding elliptic curves with a subgroup of prescribed size ⋮ A new approach to the discrete logarithm problem with auxiliary inputs ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ A survey of elliptic curves for proof systems ⋮ Generic models for group actions ⋮ Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey ⋮ A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs ⋮ PRE: stronger security notions and efficient construction with non-interactive opening ⋮ 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 ⋮ Verifiable random functions with optimal tightness ⋮ Compact hierarchical identity-based encryption based on a harder decisional problem ⋮ Distribution and Polynomial Interpolation of the Dodis-Yampolskiy Pseudo-Random Function

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete logarithm problems with auxiliary inputs