Distinguishing distributions using Chernoff information

DOI10.1007/978-3-642-16280-0_10MaRDI QIDQ4933218zbMATH OpenOpenAlexFDO

Authors Thomas Baignères, Pouyan Sepehrdad, Serge Vaudenay

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

zbMATH Keywords

block ciphersproof systemsChernoff Informationdistinguishing distributions

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Inequalities; stochastic orderings (60E15) Measures of information, entropy (94A17) Cryptography (94A60) Network protocols (68M12)

Recommendations

• The Complexity of Distinguishing Distributions (Invited Talk)
• Chernoff-type direct product theorems
• Chernoff-Type Direct Product Theorems
• Indistinguishability Amplification
• Sublinear bounds on the distinguishing advantage for multiple samples

Cites work

• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 2009963 (Why is no real title available?)
• scientific article; zbMATH DE number 1394292 (Why is no real title available?)
• scientific article; zbMATH DE number 3418509 (Why is no real title available?)
• A Parallel Repetition Theorem
• Almost optimal bounds for direct product threshold theorem
• Chernoff-Type Direct Product Theorems
• Chernoff-type direct product theorems
• Differential cryptanalysis of DES-like cryptosystems
• Error reduction by parallel repetition - a negative result
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Markov Ciphers and Differential Cryptanalysis
• Modern cryptography, probabilistic proofs and pseudo-randomness
• On Information and Sufficiency
• Parallel Repetition of Computationally Sound Protocols Revisited
• Probability Inequalities for Sums of Bounded Random Variables
• Simulating BPP using a general weak random source
• Theory of Cryptography
• Tight Bounds for Hashing Block Sources
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Universal Arguments and their Applications

Cited in

(11)

• Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
• Information Distinguishability with Application to Analysis of Failure Data
• Chernoff-Type Direct Product Theorems
• Another look at normal approximations in cryptanalysis
• Related-Key Cryptanalysis of Midori
• Unified view for notions of bit security
• Chernoff-type direct product theorems
• Rigorous upper bounds on data complexities of block cipher cryptanalysis
• Fast size approximation of a radio network in beeping model
• On data complexity of distinguishing attacks versus message recovery attacks on stream ciphers
• Authentication in constrained settings

This page was built for publication: Distinguishing distributions using Chernoff information

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