Bounded indistinguishability and the complexity of recovering secrets
From MaRDI portal
Publication:2829962
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
- scientific article; zbMATH DE number 549850 (Why is no real title available?)
- scientific article; zbMATH DE number 1088898 (Why is no real title available?)
- scientific article; zbMATH DE number 2076151 (Why is no real title available?)
- A simple proof of Bazzi's theorem
- Advances in Cryptology - CRYPTO 2003
- Almost \(k\)-wise independence versus \(k\)-wise independence
- Analysis of Boolean Functions
- Approximate inclusion-exclusion
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
- Bounded Independence Fools Halfspaces
- Bounded indistinguishability and the complexity of recovering secrets
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Cryptography in $NC^0$
- Dual polynomials for collision and element distinctness
- Efficient approximation of product distributions
- Efficient non-interactive secure computation
- How to share a secret
- Improved algorithms via approximations of probability distributions
- Inclusion-exclusion: exact and approximate
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- New degree bounds for polynomial threshold functions
- On approximate majority and probabilistic time
- On the Correlation of Parity and Small-Depth Circuits
- On the degree of Boolean functions as real polynomials
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Polylogarithmic independence can fool DNF formulas
- Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
- Quantum lower bounds for the collision and the element distinctness problems
- Robust polynomials and quantum algorithms
- Robust pseudorandom generators
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- The complexity of distributions
- The pattern matrix method
- Unifying leakage models: from probing attacks to noisy leakage.
- Zero knowledge LTCs and their applications
Cited in
(19)- scientific article; zbMATH DE number 1796950 (Why is no real title available?)
- Binary AMD circuits from secure multiparty computation
- Protecting distributed primitives against leakage: equivocal secret sharing and more
- The large-error approximate degree of \(\mathrm{AC}^0\)
- Correction to: ``Unconditionally secure computation against low-complexity leakage
- Separability and the detection of hidden channels
- On the local leakage resilience of linear secret sharing schemes
- scientific article; zbMATH DE number 1301087 (Why is no real title available?)
- Bounded indistinguishability and the complexity of recovering secrets
- Approximate Degree in Classical and Quantum Computing
- Unconditionally secure computation against low-complexity leakage
- Sampling lower bounds: Boolean average-case and permutations
- An independence relation for sets of secrets
- scientific article; zbMATH DE number 7559096 (Why is no real title available?)
- A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
- Approximate bounded indistinguishability
- A note on computational indistinguishability
- On the power of statistical zero knowledge
- Threshold Secret Sharing Requires a Linear Size Alphabet
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)
