Unifying presampling via concentration bounds
From MaRDI portal
Publication:2695631
DOI10.1007/978-3-030-90459-3_7OpenAlexW3213026663MaRDI QIDQ2695631
Qian Li, Jiapeng Zhang, Qipeng Liu, Siyao Guo
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_7
Related Items (4)
Non-uniformity and quantum advice in the quantum random oracle model ⋮ Lower bound on SNARGs in the random oracle model ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård hash functions ⋮ Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
Cites Work
- Unnamed Item
- Random oracles and non-uniformity
- The Discrete Logarithm problem with preprocessing
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- Quantum random oracle model with auxiliary input
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- On the Fourier spectrum of functions on Boolean cubes
- Some applications of hypercontractive inequalities in quantum information theory
- On the fourier tails of bounded functions over the discrete cube
- Limitations of Quantum Advice and One-Way Communication
- Random Oracles in a Quantum World
- On obfuscating point functions
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Constructive Proofs of Concentration Bounds
- Random Oracles and Auxiliary Input
- A cryptanalytic time-memory trade-off
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- Polynomial bounds for decoupling, with applications
- Automata, Languages and Programming
- Rectangles Are Nonnegative Juntas
This page was built for publication: Unifying presampling via concentration bounds
