Redeeming reset indifferentiability and applications to post-quantum security
From MaRDI portal
Publication:6157503
DOI10.1007/978-3-030-92062-3_18zbMath1514.94144OpenAlexW3216542990MaRDI QIDQ6157503
Publication date: 12 May 2023
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-92062-3_18
Related Items (2)
Generic models for group actions ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal broadcast encryption from pairings and LWE
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Classical vs quantum random oracles
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- Does Fiat-Shamir require a cryptographic hash function?
- How to record quantum queries, and applications to quantum indifferentiability
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- The distinction between fixed and random generators in group-based assumptions
- Indifferentiability of 8-Round Feistel Networks
- Reset Indifferentiability and Its Consequences
- Automated Analysis of Cryptographic Assumptions in Generic Group Models
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Careful with Composition: Limitations of the Indifferentiability Framework
- Random Oracles in a Quantum World
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Quantum lower bounds for the collision and the element distinctness problems
- Perfect Block Ciphers with Small Blocks
- The Random Oracle Model and the Ideal Cipher Model Are Equivalent
- Strengths and Weaknesses of Quantum Computing
- Resource-Restricted Indifferentiability
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Salvaging Indifferentiability in a Multi-stage Setting
- The equivalence of the random oracle model and the ideal cipher model, revisited
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Theory of Cryptography
This page was built for publication: Redeeming reset indifferentiability and applications to post-quantum security
