Tight characterizations for preprocessing against cryptographic salting
From MaRDI portal
Publication:6652927
DOI10.1007/978-3-031-68385-5_12MaRDI QIDQ6652927
Qipeng Liu, Fangqi Dong, Kewen Wu
Publication date: 13 December 2024
Cites Work
- Unnamed Item
- Unnamed Item
- A strong direct product theorem for quantum query complexity
- Improved direct product theorems for randomized query complexity
- Quantum Arthur-Merlin games
- Random oracles and non-uniformity
- Towards proving strong direct product theorems
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
- The function-inversion problem: barriers and opportunities
- How to record quantum queries, and applications to quantum indifferentiability
- Unifying presampling via concentration bounds
- On the power of nonuniformity in proofs of security
- Direct Sum Testing
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Constructive Proofs of Concentration Bounds
- Random Oracles and Auxiliary Input
- Products and Help Bits in Decision Trees
- Strong Direct Product Theorems for Quantum Communication and Query Complexity
- Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited
- On the Power of Hierarchical Identity-Based Encryption
- A direct product theorem for one-way quantum communication
- Non-uniformity and quantum advice in the quantum random oracle model
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
This page was built for publication: Tight characterizations for preprocessing against cryptographic salting
