Memory-Tight Reductions for Practical Key Encapsulation Mechanisms

DOI10.1007/978-3-030-45374-9_9MaRDI QIDQ5041159zbMATH OpenOpenAlexFDO

Authors Rishiraj Bhattacharyya

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

zbMATH Keywords

FO transformationHashed-ElGamalmemory-tight reduction

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Memory-tight multi-challenge security of public-key encryption
• The memory-tightness of authenticated encryption
• Tight time-memory trade-offs for symmetric encryption
• Compact and simple RLWE based key encapsulation mechanism
• Forward secret encrypted RAM: lower bounds and applications
• Fast and memory-efficient key recovery in side-channel attacks
• Compact and tightly selective-opening secure public-key encryption schemes
• Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
• Towards tightly secure deterministic public key encryption

Cites work

• A modular analysis of the Fujisaki-Okamoto transformation
• Another look at tightness
• Cryptography and Coding
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• scientific article; zbMATH DE number 1617924 (Why is no real title available?)
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• scientific article; zbMATH DE number 1759781 (Why is no real title available?)
• IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
• Memory lower bounds of reductions revisited
• Memory-tight reductions
• Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
• Random oracles in a quantum world
• Resource-restricted indifferentiability
• The exact security of digital signatures -- how to sign with RSA and Rabin
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Theory of Cryptography
• Tightly-secure key-encapsulation mechanism in the quantum random oracle model

Cited in

(12)

• A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
• Memory lower bounds of reductions revisited
• The memory-tightness of authenticated encryption
• On the memory-tightness of hashed ElGamal
• Hiding in plain sight: memory-tight proofs via randomness programming
• Tight time-memory trade-offs for symmetric encryption
• Forward secret encrypted RAM: lower bounds and applications
• Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
• Memory-tight multi-challenge security of public-key encryption
• A generic construction of tightly secure password-based authenticated key exchange
• Signatures with memory-tight security in the quantum random oracle model
• Succinct PPRFs via memory-tight reductions

This page was built for publication: Memory-Tight Reductions for Practical Key Encapsulation Mechanisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041159)