Bit security as computational cost for winning games with high probability
From MaRDI portal
Publication:6157548
DOI10.1007/978-3-030-92078-4_6zbMATH Open1514.94139OpenAlexW3206385257MaRDI QIDQ6157548FDOQ6157548
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
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
- Elements of Information Theory
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Simple Constructions of Almost k-wise Independent Random Variables
- Cryptographic distinguishability measures for quantum-mechanical states
- Foundations of Cryptography
- On the bit security of cryptographic primitives
- Rényi Divergence and Kullback-Leibler Divergence
- Message Authentication Codes from Unpredictable Block Ciphers
- $f$ -Divergence Inequalities
- Time space tradeoffs for attacks against one-way functions and PRGs
- Non-uniform cracks in the concrete: the power of free precomputation
- Higher order concentration for functions of weakly dependent random variables
- Strong hardness of privacy from weak traitor tracing
- GGHLite: more efficient multilinear maps from ideal lattices
- Gaussian sampling over the integers: efficient, generic, constant-time
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Another look at non-uniformity
- On the hardness of learning with rounding over small modulus
- Tighter security for efficient lattice cryptography via the Rényi divergence of optimized orders
- Improved security evaluation techniques for imperfect randomness from arbitrary distributions
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Replacing Probability Distributions in Security Games via Hellinger Distance
Cited In (1)
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)
