Towards compressed permutation oracles
From MaRDI portal
Publication:6604882
DOI10.1007/978-981-99-8730-6_12zbMATH Open1547.94425MaRDI QIDQ6604882
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Post-quantum security of the sponge construction
- Quantum collision-finding in non-uniform random functions
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- 4-round Luby-Rackoff construction is a qPRP
- Quantum chosen-ciphertext attacks against Feistel ciphers
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Quantum indistinguishability of random sponges
- Mitigating Multi-target Attacks in Hash-Based Signatures
- Quantum Collision-Resistance of Non-uniformly Distributed Functions
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- Random Oracles in a Quantum World
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Quantum lower bounds by polynomials
- On the Indifferentiability of the Sponge Construction
- Computationally Binding Quantum Commitments
- Quantum lower bounds by quantum arguments
Related Items (1)
This page was built for publication: Towards compressed permutation oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604882)
