Approximate bounded indistinguishability

DOI10.4230/LIPICS.ICALP.2017.53MaRDI QIDQ5111384zbMATH OpenFDO

Authors Andrej Bogdanov, Christopher Williamson

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2017.53

zbMATH Keywords

polynomial approximationpseudorandomnesssecret sharing

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Boolean functions (94D10)

Recommendations

• Approximate degree, weight, and indistinguishability
• Bounded indistinguishability and the complexity of recovering secrets
• Almost \(k\)-wise independence versus \(k\)-wise independence
• A tight computational indistinguishability bound for product distributions
• scientific article; zbMATH DE number 7378666

Cited in

(6)

• Bounded indistinguishability and the complexity of recovering secrets
• Approximate Degree in Classical and Quantum Computing
• Secret sharing with binary shares
• The large-error approximate degree of \(\mathrm{AC}^0\)
• Approximate degree, weight, and indistinguishability
• The large-error approximate degree of \(\mathrm{AC}^0\)

This page was built for publication: Approximate bounded indistinguishability

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