Bounded Indistinguishability and the Complexity of Recovering Secrets

DOI10.1007/978-3-662-53015-3_21zbMath1406.94027OpenAlexW2397763371MaRDI QIDQ2829962

Yuval Ishai, Andrej Bogdanov, Emanuele Viola, Christopher Williamson

Publication date: 9 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

Binary AMD Circuits from Secure Multiparty Computation ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Unnamed Item ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ On the Power of Statistical Zero Knowledge ⋮ Unnamed Item ⋮ On the local leakage resilience of linear secret sharing schemes ⋮ Unconditionally secure computation against low-complexity leakage ⋮ Correction to: ``Unconditionally secure computation against low-complexity leakage ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximate majority and probabilistic time
• Almost \(k\)-wise independence versus \(k\)-wise independence
• Approximate inclusion-exclusion
• On the degree of Boolean functions as real polynomials
• Inclusion-exclusion: exact and approximate
• Improved algorithms via approximations of probability distributions
• Dual lower bounds for approximate degree and Markov-Bernstein inequalities
• Robust polynomials and quantum algorithms
• Bounded Indistinguishability and the Complexity of Recovering Secrets
• Zero Knowledge LTCs and Their Applications
• The Complexity of Distributions
• A Simple Proof of Bazzi’s Theorem
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
• Efficient Non-interactive Secure Computation
• How to share a secret
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
• The Pattern Matrix Method
• Quantum lower bounds for the collision and the element distinctness problems
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Polylogarithmic independence fools AC ⁰ circuits
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Polylogarithmic Independence Can Fool DNF Formulas
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Efficient approximation of product distributions
• Analysis of Boolean Functions
• On the Correlation of Parity and Small-Depth Circuits
• Robust Pseudorandom Generators
• Bounded Independence Fools Halfspaces
• Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
• Advances in Cryptology - CRYPTO 2003
• Cryptography in $NC^0$
• New degree bounds for polynomial threshold functions

This page was built for publication: Bounded Indistinguishability and the Complexity of Recovering Secrets