Distinguishing Distributions Using Chernoff Information
From MaRDI portal
Publication:4933218
DOI10.1007/978-3-642-16280-0_10zbMath1286.94043OpenAlexW2102517139MaRDI QIDQ4933218
Serge Vaudenay, Thomas Baignères, Pouyan Sepehrdad
Publication date: 12 October 2010
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/153286/files/Provsec_2010.pdf
Inequalities; stochastic orderings (60E15) Cryptography (94A60) Measures of information, entropy (94A17) Statistical aspects of information-theoretic topics (62B10) Network protocols (68M12)
Related Items (7)
Another look at normal approximations in cryptanalysis ⋮ Related-Key Cryptanalysis of Midori ⋮ Rigorous upper bounds on data complexities of block cipher cryptanalysis ⋮ Authentication in Constrained Settings ⋮ Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses ⋮ On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers ⋮ Fast size approximation of a radio network in beeping model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Chernoff-type direct product theorems
- Modern cryptography, probabilistic proofs and pseudo-randomness
- Error reduction by parallel repetition - a negative result
- Simulating BPP using a general weak random source
- Almost Optimal Bounds for Direct Product Threshold Theorem
- Tight Bounds for Hashing Block Sources
- Parallel Repetition of Computationally Sound Protocols Revisited
- Chernoff-Type Direct Product Theorems
- Universal Arguments and their Applications
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Markov Ciphers and Differential Cryptanalysis
- A Parallel Repetition Theorem
- Probability Inequalities for Sums of Bounded Random Variables
- Theory of Cryptography
- On Information and Sufficiency
This page was built for publication: Distinguishing Distributions Using Chernoff Information
