Security Analysis of the Strong Diffie-Hellman Problem
From MaRDI portal
Publication:3593084
DOI10.1007/11761679_1zbMath1129.94017WikidataQ56114288 ScholiaQ56114288MaRDI QIDQ3593084
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
Related Items
Computing discrete logarithms in an interval, Vector Commitments and Their Applications, Compact hierarchical identity-based encryption based on a harder decisional problem, Efficient Non-interactive Range Proof, Blind Identity-Based Encryption and Simulatable Oblivious Transfer, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Zero-Knowledge Sets with Short Proofs, CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption, Discrete logarithm problems with auxiliary inputs, Unconditionally anonymous ring and mesh signatures, Attribute-based encryption schemes with constant-size ciphertexts, Group-oriented fair exchange of signatures, Programmable hash functions and their applications, Efficient selective identity-based encryption without random oracles, Verifiable random functions: relations to identity-based key encapsulation and new constructions, The random oracle model: a twenty-year retrospective, Recent progress on the elliptic curve discrete logarithm problem, Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group, Secure simultaneous bit extraction from Koblitz curves, Research on attacking a special elliptic curve discrete logarithm problem, Rerandomizable signatures under standard assumption, Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin, Short signatures without random oracles and the SDH assumption in bilinear groups, Elliptic curve cryptography: the serpentine course of a paradigm shift, A reduction of security notions in designated confirmer signatures, Verifiable Random Functions from Standard Assumptions, Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys, Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions, A Static Diffie-Hellman Attack on Several Direct Anonymous Attestation Schemes, Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates, Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials, A new approach to the discrete logarithm problem with auxiliary inputs, Multi-Identity Single-Key Decryption without Random Oracles, Efficient Protocols for Set Membership and Range Proofs, One-Round ID-Based Blind Signature Scheme without ROS Assumption, Another look at non-standard discrete log and Diffie-Hellman problems, Verifiable Random Functions from Identity-Based Key Encapsulation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short signatures from the Weil pairing
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Strong Primes are Easy to Find
- 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
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Public Key Cryptography - PKC 2005
- Cryptography and Coding
