Unified view for notions of bit security
From MaRDI portal
Publication:6605331
DOI10.1007/978-981-99-8736-8_12zbMATH Open1547.94429MaRDI QIDQ6605331FDOQ6605331
Authors: Shun Watanabe, Kenji Yasunaga 
Publication date: 13 September 2024
Recommendations
- Bit security as computational cost for winning games with high probability
- On the bit security of cryptographic primitives
- Replacing Probability Distributions in Security Games via Hellinger Distance
- scientific article; zbMATH DE number 1839461
- Time-advantage ratios under simple transformations: applications in cryptography
Cites Work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Bit security as computational cost for winning games with high probability
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Cryptographic assumptions: a position paper
- Distinguishing distributions using Chernoff information
- Foundations of Cryptography
- Generalized privacy amplification
- Higher order concentration for functions of weakly dependent random variables
- Leftover Hash Lemma, Revisited
- Message Authentication Codes from Unpredictable Block Ciphers
- Nearly one-sided tests and the Goldreich-Levin predicate
- On the bit security of cryptographic primitives
- Replacing Probability Distributions in Security Games via Hellinger Distance
- Rényi Divergence and Kullback-Leibler Divergence
- Simple Constructions of Almost k-wise Independent Random Variables
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
This page was built for publication: Unified view for notions of bit security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605331)
