Memory-tight multi-challenge security of public-key encryption
From MaRDI portal
Publication:6135444
DOI10.1007/978-3-031-22969-5_16zbMath1519.94140OpenAlexW4320082912MaRDI QIDQ6135444
Publication date: 25 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22969-5_16
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Memory lower bounds of reductions revisited
- Memory-tight reductions
- A modular analysis of the Fujisaki-Okamoto transformation
- The algebraic group model and its applications
- Secure integration of asymmetric and symmetric encryption schemes
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- The memory-tightness of authenticated encryption
- A classification of computational assumptions in the algebraic group model
- On the memory-tightness of hashed ElGamal
- On the streaming indistinguishability of a random permutation and a random function
- Super-linear time-memory trade-offs for symmetric encryption
- Hiding in plain sight: memory-tight proofs via randomness programming
- Tight time-memory trade-offs for symmetric encryption
- Tightly CCA-Secure Encryption Without Pairings
- Tightly Secure Signatures and Public-Key Encryption
- Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
- 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
- Secure integration of asymmetric and symmetric encryption schemes
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
- Cryptography and Coding
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- Memory-tight multi-challenge security of public-key encryption
This page was built for publication: Memory-tight multi-challenge security of public-key encryption
