Bit security as computational cost for winning games with high probability
From MaRDI portal
Publication:6157548
DOI10.1007/978-3-030-92078-4_6zbMath1514.94139OpenAlexW3206385257MaRDI QIDQ6157548
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92078-4_6
Cites Work
- On the bit security of cryptographic primitives
- Gaussian sampling over the integers: efficient, generic, constant-time
- Higher order concentration for functions of weakly dependent random variables
- Improved security evaluation techniques for imperfect randomness from arbitrary distributions
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- On the Hardness of Learning with Rounding over Small Modulus
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- $f$ -Divergence Inequalities
- Rényi Divergence and Kullback-Leibler Divergence
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Strong Hardness of Privacy from Weak Traitor Tracing
- Message Authentication Codes from Unpredictable Block Ciphers
- Tighter Security for Efficient Lattice Cryptography via the Rényi Divergence of Optimized Orders
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Simple Constructions of Almost k-wise Independent Random Variables
- Foundations of Cryptography
- Cryptographic distinguishability measures for quantum-mechanical states
- Another look at non-uniformity
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Elements of Information Theory
- Replacing Probability Distributions in Security Games via Hellinger Distance
This page was built for publication: Bit security as computational cost for winning games with high probability
