Towards breaking the exponential barrier for general secret sharing
From MaRDI portal
Publication:1648814
DOI10.1007/978-3-319-78381-9_21zbMath1423.94131OpenAlexW2794870184MaRDI QIDQ1648814
Vinod Vaikuntanathan, Hoeteck Wee, Tianren Liu
Publication date: 9 July 2018
Full work available at URL: https://hdl.handle.net/1721.1/124959
Related Items
Upslices, downslices, and secret-sharing with complexity of \(1.5^n\), Quadratic secret sharing and conditional disclosure of secrets, On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate, Measuring, simulating and exploiting the head concavity phenomenon in BKZ, Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions, Optimal linear multiparty conditional disclosure of secrets protocols, Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, Unnamed Item, Placing conditional disclosure of secrets in the communication complexity universe, Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dichotomies in the complexity of solving systems of equations over finite semigroups
- The ellipsoid method and its consequences in combinatorial optimization
- Representing Boolean functions as polynomials modulo composite numbers
- The size of a share must be large
- Protecting data privacy in private information retrieval schemes
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Conditional disclosure of secrets via non-linear reconstruction
- Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
- Superpolynomial lower bounds for monotone span programs
- Secret Sharing and Statistical Zero Knowledge
- A minimal model for secure computation (extended abstract)
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of GGH Map
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- 2-Server PIR with Sub-Polynomial Communication
- Efficient Non-interactive Secure Computation
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Candidate One-Way Functions Based on Expander Graphs
- Matching Vector Codes
- Private information retrieval
- Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Towards 3-query locally decodable codes of subexponential length
- 3-Query Locally Decodable Codes of Subexponential Length
- Strongly refuting random CSPs below the spectral threshold
- Sum of squares lower bounds for refuting any CSP
- Analysis of Boolean Functions
- Partial Garbling Schemes and Their Applications
- New Bounds for Matching Vector Families
- How to use indistinguishability obfuscation
- On the Power of Nonlinear Secret-Sharing
- On ε‐biased generators in NC0
- On the Cryptographic Complexity of the Worst Functions
