Tight characterizations for preprocessing against cryptographic salting

DOI10.1007/978-3-031-68385-5_12MaRDI QIDQ6652927zbMATH OpenFDO

Authors Fangqi Dong, Qipeng Liu, Kewen Wu

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68385-5_12

zbMATH Keywords

compressed oraclecryptographic saltingdirect product theoremnon-uniform security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The query-complexity of preprocessing attacks
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• Random oracles and non-uniformity
• Password hashing and preprocessing
• Unifying presampling via concentration bounds

Cites work

• A direct product theorem for one-way quantum communication
• A strong direct product theorem for quantum query complexity
• Constructive proofs of concentration bounds
• Direct sum testing (extended abstract)
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• How to record quantum queries, and applications to quantum indifferentiability
• scientific article; zbMATH DE number 5485571 (Why is no real title available?)
• scientific article; zbMATH DE number 7788481 (Why is no real title available?)
• Improved direct product theorems for randomized query complexity
• Non-uniformity and quantum advice in the quantum random oracle model
• On the compressed-oracle technique, and post-quantum security of proofs of sequential work
• On the power of hierarchical identity-based encryption
• On the power of nonuniformity in proofs of security
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Products and Help Bits in Decision Trees
• Quantum Arthur-Merlin games
• Random Oracles and Auxiliary Input
• Random oracles and non-uniformity
• The function-inversion problem: barriers and opportunities
• Time space tradeoffs for attacks against one-way functions and PRGs
• Time-space lower bounds for finding collisions in Merkle-Damgård hash functions
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Towards proving strong direct product theorems
• Unifying presampling via concentration bounds

Cited in

(2)

• The query-complexity of preprocessing attacks
• Improved quantum lifting by coherent measure-and-reprogram

This page was built for publication: Tight characterizations for preprocessing against cryptographic salting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652927)