The Hardness of the DHK Problem in the Generic Group Model

No abstract is available for this paper.

• Publication year

  2006

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Cramer-Shoup Encryption Scheme is Plaintext Aware in the Standard Model

  2006cited by this paper
• Abstract Models of Computation in Cryptography

  2005cited by this paper
• HMQV: A High-Performance Secure Diffie-Hellman Protocol

  2005cited by this paper
• Hierarchical Identity Based Encryption with Constant Size Ciphertext

  2005cited by this paper
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles

  2004cited by this paper
• The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols

  2004cited by this paper
• On Cryptographic Assumptions and Challenges

  2003cited by this paper
• Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model

  2002cited by this paper
• The Exact Security of ECIES in the Generic Group Model

  2001cited by this paper
• On the Existence of 3-Round Zero-Knowledge Protocols

  1998cited by this paper
• Lower Bounds on Generic Algorithms in Groups

  1998cited by this paper
• Relations among Notions of Security for Public-Key Encryption Schemes

  1998cited by this paper
• Lower Bounds for Discrete Logarithms and Related Problems

  1997influential reference
• Complexity of a determinate algorithm for the discrete logarithm

  1994cited by this paper
• Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks

  1991cited by this paper
• On the Complexity of Matrix Group Problems I

  1984cited by this paper
• Fast Probabilistic Algorithms for Verification of Polynomial Identities

  1980cited by this paper

• Towards Witness Encryption Without Multilinear Maps - Extractable Witness Encryption for Multi-subset Sum Instances with No Small Solution to the Homogeneous Problem

  2021cites this paper
• The Discrete-Logarithm Problem with Preprocessing

  2018cites this paper
• Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models

  2018cites this paper
• A universal method for realizing non-repudiable provable data possession in cloud storage

  2016cites this paper
• The Hunting of the SNARK

  2016cites this paper
• Quantization using jet space geometry and identity management using credential schemes

  2016cites this paper
• Non-Repudiable Proofs of Storage in Cloud

  2015cites this paper
• Compact and Efficient UC Commitments Under Atomic-Exchanges

  2014influential citation
• Attribute-based group signature without random oracles with attribute anonymity

  2014cites this paper
• Input-Aware Equivocable Commitments and UC-secure Commitments with Atomic Exchanges

  2013influential citation
• Programmable and Non-programmable Models in Security Proofs

  2013cites this paper
• Short Attribute-Based Group Signature without Random Oracles with Attribute Anonymity

  2013cites this paper
• Provable Security

  2013influential citation
• Recursive composition and bootstrapping for SNARKS and proof-carrying data

  2013cites this paper
• Broadcast Encryption with Traitor Tracing

  2013cites this paper
• Adaptive CCA broadcast encryption with constant-size secret keys and ciphertexts

  2012cites this paper
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

  2012cites this paper
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cites this paper
• Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness

  2012cites this paper
• On the Generic Hardness of DDH-II

  2012cites this paper
• The Computational Square-Root Exponent Problem- Revisited

  2011cites this paper
• Remote data checking using provable data possession

  2011cites this paper
• PA1 and IND-CCA2 Do Not Guarantee PA2: Brief Examples

  2010cites this paper
• Dynamic fully forward-secure group signatures

  2010cites this paper
• Eciency Limitations for -Protocols for Group Homomorphisms ? (Full Version)

  2010cites this paper
• Efficiency Limitations for Σ-Protocols for Group Homomorphisms

  2010cites this paper
• Studies in program obfuscation

  2010cites this paper
• Efficient traceable signatures in the standard model

  2009cites this paper
• Polylogarithmic two-round argument systems

  2008cites this paper
• On the Equivalence of Generic Group Models

  2008influential citation
• Multi-use unidirectional proxy re-signatures

  2008cites this paper
• Publicly Verifiable Remote Data Integrity

  2008cites this paper
• Traitor tracing with constant size ciphertext

  2008cites this paper
• EC-RAC (ECDLP Based Randomized Access Control): Provably Secure RFID authentication protocol

  2008cites this paper
• A CCA Secure Hybrid Damgård's ElGamal Encryption

  2008cites this paper
• Provable data possession at untrusted stores

  2007cites this paper
• Perfect NIZK with Adaptive Soundness

  2007cites this paper
• Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions

  2006cites this paper
• The Structured Generic-Group Model

  year unknowncites this paper