On the memory-tightness of hashed ElGamal

DOI10.1007/978-3-030-45724-2_2zbMath1492.94112OpenAlexW3022466961MaRDI QIDQ2119004

Ashrujit Ghoshal, Stefano Tessaro

Publication date: 23 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-45724-2_2

zbMATH Keywords

foundationslower boundspublic-key cryptographygeneric group modelmemory-tightnesscompression arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Proof-carrying data without succinct arguments ⋮ Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ The query-complexity of preprocessing attacks ⋮ The memory-tightness of authenticated encryption

Cites Work

• Unnamed Item
• Memory lower bounds of reductions revisited
• The Discrete Logarithm problem with preprocessing
• Memory-tight reductions
• The algebraic group model and its applications
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Cryptography and Coding
• Theory of Cryptography

This page was built for publication: On the memory-tightness of hashed ElGamal