Unified view for notions of bit security
From MaRDI portal
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
Cited in
(5)- 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
- IND-CPA-D and KR-D security with reduced noise from the HintLWE problem
- Bit security as cost to demonstrate advantage
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)
