Approximate bounded indistinguishability

DOI10.4230/LIPICS.ICALP.2017.53zbMATH Open1457.68121MaRDI QIDQ5111384FDOQ5111384

Authors: Andrej Bogdanov, Christopher Williamson 

Publication date: 27 May 2020

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

zbMATH Keywords

polynomial approximationpseudorandomnesssecret sharing

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate Degree in Classical and Quantum Computing

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)