Another look at non-standard discrete log and Diffie-Hellman problems

DOI10.1515/JMC.2008.014zbMath1156.94357MaRDI QIDQ3612242

Neal Koblitz, Alfred J. Menezes

Publication date: 3 March 2009

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

zbMATH Keywords

provable securityindex calculusDiffie-Hellman problemdiscrete log problemJacobian groupsPublic-Key Cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Short pairing-free blind signatures with exponential security ⋮ Hierarchical Deterministic Bitcoin Wallets that Tolerate Key Leakage ⋮ The One-More Discrete Logarithm Assumption in the Generic Group Model ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Fully adaptive Schnorr threshold signatures ⋮ Elliptic curve cryptography: the serpentine course of a paradigm shift ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem

Cites Work

• Another look at generic groups
• Another look at ``provable security
• Index calculus in class groups of non-hyperelliptic curves of genus three
• Factoring integers with elliptic curves
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• The Diffie-Hellman protocol
• An elliptic curve trapdoor system
• A double large prime variation for small genus hyperelliptic index calculus
• A Note on Chosen-Basis Decisional Diffie-Hellman Assumptions
• Transitive Signatures: New Schemes and Proofs
• Security Analysis of the Strong Diffie-Hellman Problem
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• When e-th Roots Become Easier Than Factoring
• Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)
• Another Look at “Provable Security”. II
• Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Improved On-Line/Off-Line Threshold Signatures
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles

This page was built for publication: Another look at non-standard discrete log and Diffie-Hellman problems