Sublinear bounds on the distinguishing advantage for multiple samples

DOI10.1007/978-3-030-58208-1_10zbMATH Open1475.94051OpenAlexW3080547195MaRDI QIDQ1995509FDOQ1995509

Authors: Serge Fehr, Serge Vaudenay 

Publication date: 23 February 2021

Full work available at URL: https://ir.cwi.nl/pub/30130

Recommendations

• The Complexity of Distinguishing Distributions (Invited Talk)
• Computational indistinguishability: A sample hierarchy
• scientific article; zbMATH DE number 1335877
• Information-theoretic indistinguishability via the chi-squared method
• scientific article; zbMATH DE number 2009946

zbMATH Keywords

probability distributionBoolean distribution

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Cited In (4)

• The Complexity of Distinguishing Distributions (Invited Talk)
• Distinguishing distributions using Chernoff information
• A tight computational indistinguishability bound for product distributions
• From absolute distinguishability to positive distinguishability

This page was built for publication: Sublinear bounds on the distinguishing advantage for multiple samples

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