Towards compressed permutation oracles
From MaRDI portal
Publication:6604882
DOI10.1007/978-981-99-8730-6_12zbMATH Open1547.94425MaRDI QIDQ6604882FDOQ6604882
Authors: Dominique Unruh 
Publication date: 13 September 2024
Recommendations
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Deterministic random oracles
- A note on quantum collision resistance of double-block-length compression functions
- On quantum secure compressing pseudorandom functions
Cites Work
- Secure identity-based encryption in the quantum random oracle model
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- On the Indifferentiability of the Sponge Construction
- Title not available (Why is that?)
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Random oracles in a quantum world
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Computationally binding quantum commitments
- Post-quantum security of the sponge construction
- Mitigating multi-target attacks in hash-based signatures
- Quantum collision-finding in non-uniform random functions
- Quantum collision-resistance of non-uniformly distributed functions
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- 4-round Luby-Rackoff construction is a qPRP
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Quantum indistinguishability of random sponges
Cited In (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)
