Unifying presampling via concentration bounds

DOI10.1007/978-3-030-90459-3_7MaRDI QIDQ2695631zbMATH OpenOpenAlexFDO

Authors Siyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_7

zbMATH Keywords

non-uniform securitypresampling technique

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Concentration estimates for learning with unbounded sampling
• On Unifying the Space of ℓ₀-Sampling Algorithms
• Beyond consistent reconstructions: optimality and sharp bounds for generalized sampling, and application to the uniform resampling problem
• Concentration bounds for stochastic approximations
• Concentration inequalities on the multislice and for sampling without replacement
• Unified estimation of densities on bounded and unbounded domains
• Theoretical Guarantees for Approximate Sampling from Smooth and Log-Concave Densities
• Bounds on the efficiency of unbalanced ranked-set sampling
• Mixing convex-optimization bounds for maximum-entropy sampling
• Nonasymptotic bounds for sampling algorithms without log-concavity

Cites work

• A cryptanalytic time-memory trade-off
• Automata, Languages and Programming
• Constructive proofs of concentration bounds
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• How to record quantum queries, and applications to quantum indifferentiability
• Limitations of Quantum Advice and One-Way Communication
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• On obfuscating point functions
• On the Fourier spectrum of functions on Boolean cubes
• On the Fourier tails of bounded functions over the discrete cube
• Polynomial bounds for decoupling, with applications
• Quantum random oracle model with auxiliary input
• Quantum security proofs using semi-classical oracles
• Random Oracles and Auxiliary Input
• Random oracles and non-uniformity
• Random oracles in a quantum world
• Rectangles are nonnegative juntas
• Some applications of hypercontractive inequalities in quantum information theory
• The Discrete Logarithm problem with preprocessing
• The need for structure in quantum speedups
• Time space tradeoffs for attacks against one-way functions and PRGs
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions

Cited in

(13)

• Random oracles and non-uniformity
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• 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
• The NISQ complexity of collision finding
• Tight characterizations for preprocessing against cryptographic salting
• Classical vs quantum advice and proofs under classically-accessible oracle
• Offline-online indifferentiability of cryptographic systems
• Tight quantum time-space tradeoffs for permutation inversion
• The structured generic-group model

This page was built for publication: Unifying presampling via concentration bounds

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