Document Open Access Logo

Approximate Bounded Indistinguishability

Authors Andrej Bogdanov, Christopher Williamson



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2017.53.pdf
  • Filesize: 443 kB
  • 11 pages

Document Identifiers

Author Details

Andrej Bogdanov
Christopher Williamson

Cite AsGet BibTex

Andrej Bogdanov and Christopher Williamson. Approximate Bounded Indistinguishability. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 53:1-53:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.ICALP.2017.53

Abstract

Two distributions over n-bit strings are (k,delta)-wise indistinguishable if no statistical test that observes k of the n bits can tell the two distributions apart with advantage better than delta. Motivated by secret sharing and cryptographic leakage resilience, we study the existence of pairs of distributions that are (k, delta)-wise indistinguishable, but can be distinguished by some function f of suitably low complexity. We prove bounds tight up to constants when f is the OR function, and tight up to logarithmic factors when f is a read-once uniform AND \circ OR formula, extending previous works that address the perfect indistinguishability case delta = 0. We also give an elementary proof of the following result in approximation theory: If p is a univariate degree-k polynomial such that |p(x)| <= 1 for all |x| <= 1 and p(1) = 1, then l (p) >= 2^{Omega(p'(1)/k)}, where lˆ (p) is the sum of the absolute values of p’s coefficients. A more general 1 statement was proved by Servedio, Tan, and Thaler (2012) using complex-analytic methods. As a secondary contribution, we derive new threshold weight lower bounds for bounded depth AND-OR formulas.
Keywords
  • pseudorandomness
  • polynomial approximation
  • secret sharing

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Richard Beigel. The polynomial method in circuit complexity. In 8th Structure in Complexity Theory Conference, pages 82-95. IEEE, 1993. Google Scholar
  2. Richard Beigel. Perceptrons, PP, and the polynomial hierarchy. Computational Complexity, 4:339-349, 1994. URL: http://dx.doi.org/10.1007/BF01263422.
  3. Andrej Bogdanov, Yuval Ishai, Emanuele Viola, and Christopher Williamson. Bounded indistinguishability and the complexity of recovering secrets. In CRYPTO, 2016. Google Scholar
  4. Mark Bun and Justin Thaler. Dual lower bounds for approximate degree and markov-bernstein inequalities. In Coll. on Automata, Languages and Programming (ICALP), pages 303-314, 2013. Google Scholar
  5. Mark Bun and Justin Thaler. Hardness amplification and the approximate degree of constant-depth circuits. Electronic Colloquium on Computational Complexity (ECCC), 2013. Google Scholar
  6. Merrick L. Furst, James B. Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, 1984. Google Scholar
  7. Johan Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA, pages 6-20, 1986. URL: http://dx.doi.org/10.1145/12130.12132.
  8. Johan Håstad. On the correlation of parity and small-depth circuits. SIAM J. Comput., 43(5):1699-1708, 2014. URL: http://dx.doi.org/10.1137/120897432.
  9. M. Krause. On the computational power of boolean decision lists. In Computational Complexity, pages 362-375, 2005. Google Scholar
  10. Nathan Linial and Noam Nisan. Approximate inclusion-exclusion. Combinatorica, 10(4):349-365, 1990. Google Scholar
  11. Marvin Minsky and Seymour Papert. Perceptrons. MIT Press, Cambridge, MA, 1969. Google Scholar
  12. Moni Naor and Adi Shamir. Visual cryptography. In Advances in Cryptology - EUROCRYPT'94, volume 950 of Lecture Notes in Computer Science, pages 1-12. Springer Berlin Heidelberg, 1994. Google Scholar
  13. Noam Nisan and Mario Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4:301-313, 1994. Google Scholar
  14. R. Servedio, L-Y. Tan, and J. Thaler. Attribute-efficient learning and weight-degree tradeoffs for polynomial threshold functions. In COLT, 2012. Google Scholar
  15. Alexander A. Sherstov. Breaking the Minsky-Papert barrier for constant-depth circuits. In ACM Symp. on the Theory of Computing (STOC), pages 223-232, 2014. Google Scholar
  16. Alexander A. Sherstov. The power of asymmetry in constant-depth circuits. In IEEE Symp. on Foundations of Computer Science (FOCS), 2015. Google Scholar
  17. Robert Špalek. A dual polynomial for OR. CoRR, abs/0803.4516, 2008. URL: http://arxiv.org/abs/0803.4516.
  18. Andrew Yao. Separating the polynomial-time hierarchy by oracles. In 26th IEEE Symp. on Foundations of Computer Science (FOCS), pages 1-10, 1985. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail