Security Analysis of the Strong Diffie-Hellman Problem
From MaRDI portal
Publication:3593084
DOI10.1007/11761679_1zbMATH Open1129.94017DBLPconf/eurocrypt/Cheon06OpenAlexW1523567567WikidataQ56114288 ScholiaQ56114288MaRDI QIDQ3593084FDOQ3593084
Authors: Jung Hee Cheon 
Publication date: 24 September 2007
Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11761679_1
Recommendations
- scientific article; zbMATH DE number 1588479
- On the bit security of the weak Diffie-Hellman problem
- On the bit security of the Diffie-Hellman key
- The Diffie-Hellman problem and generalization of Verheul's theorem
- Bit security of the hyperelliptic curves Diffie-Hellman problem
- On the bit security of elliptic curve Diffie-Hellman
- On the security of the Merkle- Hellman cryptographic scheme (Corresp.)
- scientific article; zbMATH DE number 708833
- Cryptanalysis of a homomorphic encryption scheme
Cites Work
- Title not available (Why is that?)
- Short signatures from the Weil pairing
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Monte Carlo Methods for Index Computation (mod p)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Strong Primes are Easy to Find
- Cryptography and Coding
- Title not available (Why is that?)
- Public Key Cryptography - PKC 2005
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Title not available (Why is that?)
Cited In (60)
- Security-level switchable attribute-based encryption under the strictly weaker assumption family
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Recent progress on the elliptic curve discrete logarithm problem
- Verifiable Random Functions from Identity-Based Key Encapsulation
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Computing discrete logarithms in an interval
- Non-zero inner product encryption with short ciphertexts and private keys
- One-Round ID-Based Blind Signature Scheme without ROS Assumption
- Efficient selective identity-based encryption without random oracles
- Attribute-based encryption schemes with constant-size ciphertexts
- Computing interval discrete logarithm problem with restricted jump method
- Elliptic curve cryptography: the serpentine course of a paradigm shift
- A static Diffie-Hellman attack on several direct anonymous attestation schemes
- Zero-Knowledge Sets with Short Proofs
- Another look at non-standard discrete log and Diffie-Hellman problems
- Vector commitments and their applications
- Efficient Protocols for Set Membership and Range Proofs
- Secure simultaneous bit extraction from Koblitz curves
- Group-oriented fair exchange of signatures
- Programmable hash functions and their applications
- Multi-Identity Single-Key Decryption without Random Oracles
- Rerandomizable signatures under standard assumption
- A reduction of security notions in designated confirmer signatures
- Efficient Non-interactive Range Proof
- Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- Succinct vector, polynomial, and functional commitments from lattices
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- Discrete logarithm problems with auxiliary inputs
- The random oracle model: a twenty-year retrospective
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Verifiable random functions: relations to identity-based key encapsulation and new constructions
- Accountable identity-based encryption with distributed private key generators
- Unconditionally anonymous ring and mesh signatures
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Remarks on Cheon’s Algorithms for Pairing-Related Problems
- Revisiting BBS signatures
- Verifiable random functions from standard assumptions
- Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin
- A fast and simple partially oblivious PRF, with applications
- Solving discrete logarithm problem in an interval using periodic iterates
- A new approach to efficient revocable attribute-based anonymous credentials
- Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice
- Research on attacking a special elliptic curve discrete logarithm problem
- Compact hierarchical identity-based encryption based on a Harder decisional problem
- Compact Attribute-Based and Online-Offline Multi-input Inner Product Encryptions from Standard Static Assumptions (Short Paper)
- Decentralized multi-authority ABE for \(\mathsf{NC}^1\) from BDH
- A new approach to the discrete logarithm problem with auxiliary inputs
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks
- On the unforgeability of the Chaum-Pedersen blind signature scheme
- Circuit ABE with \(\mathsf{poly}(\mathrm{depth},\lambda )\)-sized ciphertexts and keys from lattices
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- On cycles of pairing-friendly abelian varieties
- DiSSECT: distinguisher of standard and simulated elliptic curves via traits
- Optimal generic attack against basic Boneh-Boyen signatures
Uses Software
This page was built for publication: Security Analysis of the Strong Diffie-Hellman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593084)
