Breaking the circuit-size barrier in secret sharing
From MaRDI portal
(Redirected from Publication:5230331)
Recommendations
- Towards breaking the exponential barrier for general secret sharing
- Secret-Sharing Schemes: A Survey
- The share size of secret-sharing schemes for almost all access structures and graphs
- Secret sharing lower bound: either reconstruction is hard or shares are long
- scientific article; zbMATH DE number 176543
Cited in
(40)- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- Probabilistic secret sharing
- Secret-sharing schemes for high slices
- New upper bounds for evolving secret sharing via infinite branching programs
- Reducing the share size of weighted threshold secret sharing schemes via Chow parameters approximation
- Exact information ratios for secret sharing on small graphs with girth at least 5
- A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- The share size of secret-sharing schemes for almost all access structures and graphs
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Improved polynomial secret-sharing schemes
- scientific article; zbMATH DE number 7559047 (Why is no real title available?)
- Linear Threshold Secret-Sharing with Binary Reconstruction
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Towards breaking the exponential barrier for general secret sharing
- Cutting-edge cryptography through the lens of secret sharing
- Quadratic secret sharing and conditional disclosure of secrets
- Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs
- Measuring, simulating and exploiting the head concavity phenomenon in BKZ
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Placing conditional disclosure of secrets in the communication complexity universe
- Threshold secret sharing requires a linear-size alphabet
- Secret sharing schemes for ports of matroids of rank 3.
- Cryptography with weights: MPC, encryption and signatures
- Succinct computational secret sharing for monotone circuits
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- Polynomial secret sharing schemes and algebraic matroids
- Cryptography with weak privacy
- On abelian and homomorphic secret sharing schemes
- Fully anonymous secret sharing
- Secret sharing lower bound: either reconstruction is hard or shares are long
- Lower bounds for secret-sharing schemes for \(k\)-hypergraphs
- Disincentivize collusion in verifiable secret sharing
- Secret-sharing schemes for general and uniform access structures
- Secret sharing with certified deletion
- Succinct computational secret sharing
- Bounded indistinguishability and the complexity of recovering secrets
- Optimal linear multiparty conditional disclosure of secrets protocols
- Verification protocol for stable matching from conditional disclosure of secrets
This page was built for publication: Breaking the circuit-size barrier in secret sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230331)
