Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
From MaRDI portal
Publication:5041159
DOI10.1007/978-3-030-45374-9_9zbMath1501.94027OpenAlexW3020912744MaRDI QIDQ5041159
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_9
Related Items (4)
Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ On the memory-tightness of hashed ElGamal
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Memory lower bounds of reductions revisited
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Memory-tight reductions
- A modular analysis of the Fujisaki-Okamoto transformation
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Another Look at Tightness
- Random Oracles in a Quantum World
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- 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
- Resource-Restricted Indifferentiability
- Cryptography and Coding
- Theory of Cryptography
This page was built for publication: Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
