Bounded indistinguishability and the complexity of recovering secrets
From MaRDI portal
Publication:2829962
DOI10.1007/978-3-662-53015-3_21zbMATH Open1406.94027OpenAlexW2397763371MaRDI QIDQ2829962FDOQ2829962
Authors: Andrej Bogdanov, Yuval Ishai, 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
Recommendations
- Approximate bounded indistinguishability
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\)
- Towards breaking the exponential barrier for general secret sharing
- Breaking the circuit-size barrier in secret sharing
Cites Work
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Linear degree extractors and the inapproximability of max clique and chromatic number
- How to share a secret
- Analysis of Boolean Functions
- On the degree of Boolean functions as real polynomials
- The pattern matrix method
- Title not available (Why is that?)
- Bounded Independence Fools Halfspaces
- Advances in Cryptology - CRYPTO 2003
- Cryptography in $NC^0$
- Quantum lower bounds for the collision and the element distinctness problems
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Robust pseudorandom generators
- Approximate inclusion-exclusion
- A Simple Proof of Bazzi’s Theorem
- Polylogarithmic independence can fool DNF formulas
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Efficient approximation of product distributions
- Robust polynomials and quantum algorithms
- Title not available (Why is that?)
- Almost \(k\)-wise independence versus \(k\)-wise independence
- On approximate majority and probabilistic time
- Inclusion-exclusion: exact and approximate
- Title not available (Why is that?)
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Improved algorithms via approximations of probability distributions
- The complexity of distributions
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Unifying Leakage Models: From Probing Attacks to Noisy Leakage.
- New degree bounds for polynomial threshold functions
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Efficient non-interactive secure computation
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities
- On the Correlation of Parity and Small-Depth Circuits
- Zero Knowledge LTCs and Their Applications
- Dual polynomials for collision and element distinctness
Cited In (18)
- Title not available (Why is that?)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$
- Title not available (Why is that?)
- Threshold Secret Sharing Requires a Linear Size Alphabet
- Sampling Lower Bounds: Boolean Average-Case and Permutations
- Bounded Indistinguishability and the Complexity of Recovering Secrets
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Title not available (Why is that?)
- An independence relation for sets of secrets
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- Binary AMD Circuits from Secure Multiparty Computation
- Separability and the detection of hidden channels
- Unconditionally secure computation against low-complexity leakage
- A note on computational indistinguishability
- On the Power of Statistical Zero Knowledge
- Approximate Degree in Classical and Quantum Computing
- Title not available (Why is that?)
- On the local leakage resilience of linear secret sharing schemes
This page was built for publication: Bounded indistinguishability and the complexity of recovering secrets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829962)
