Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model

DOI10.1007/3-540-36178-2_6zbMath1065.94546OpenAlexW2142508909MaRDI QIDQ4412791

Alexander W. Dent

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36178-2_6

zbMATH Keywords

signature schemeasymmetric encryptioncryptographic schemes

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Does Fiat-Shamir require a cryptographic hash function? ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ On the multi-user security of short Schnorr signatures with preprocessing ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ To label, or not to label (in generic groups) ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Succinct functional commitment for a large class of arithmetic circuits ⋮ Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems ⋮ A synthetic indifferentiability analysis of some block-cipher-based hash functions ⋮ Hash function requirements for Schnorr signatures ⋮ A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ On the Equivalence of Generic Group Models ⋮ Cryptography and algorithmic randomness ⋮ On instantiating the algebraic group model from falsifiable assumptions