Bit security as computational cost for winning games with high probability

DOI10.1007/978-3-030-92078-4_6MaRDI QIDQ6157548zbMATH OpenOpenAlexFDO

Authors Shun Watanabe, Kenji Yasunaga

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

zbMATH Keywords

bit securityGoldreich-Levin theoremRényi divergence

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Game-theoretic security for bit commitment
• Toward a game theoretic view of secure computation
• Towards a game theoretic view of secure computation
• Gambling, computational information and encryption security
• Game theoretic security of quantum bit commitment
• scientific article; zbMATH DE number 549855
• A Calculus for Game-Based Security Proofs

Cites work

• f -Divergence Inequalities
• Another look at non-uniformity
• Cryptographic distinguishability measures for quantum-mechanical states
• Elements of Information Theory
• Foundations of Cryptography
• Gaussian sampling over the integers: efficient, generic, constant-time
• GGHLite: more efficient multilinear maps from ideal lattices
• Higher order concentration for functions of weakly dependent random variables
• Improved security evaluation techniques for imperfect randomness from arbitrary distributions
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
• Message Authentication Codes from Unpredictable Block Ciphers
• Non-uniform cracks in the concrete: the power of free precomputation
• On the bit security of cryptographic primitives
• On the hardness of learning with rounding over small modulus
• Rényi Divergence and Kullback-Leibler Divergence
• Replacing Probability Distributions in Security Games via Hellinger Distance
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• Simple Constructions of Almost k-wise Independent Random Variables
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Strong hardness of privacy from weak traitor tracing
• 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

Cited in

(6)

• Unified view for notions of bit security
• Bit security: optimal adversaries, equivalence results, and a toolbox for computational-statistical security analysis
• Bit-security preserving hardness amplification
• Multiple-tweak differential attack against SCARF
• Truncator: time-space tradeoff of cryptographic primitives
• IND-CPA-D and KR-D security with reduced noise from the HintLWE problem

This page was built for publication: Bit security as computational cost for winning games with high probability

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