Breaking the circuit-size barrier in secret sharing

DOI10.1145/3188745.3188936zbMATH Open1428.94108OpenAlexW2809318426MaRDI QIDQ5230331FDOQ5230331

Tianren Liu, Vinod Vaikuntanathan

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3188745.3188936

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 Keywords

secret sharinginformation-theoretic cryptography

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (25)

• Probabilistic secret sharing
• Title not available (Why is that?)
• 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
• Secret sharing schemes for ports of matroids of rank 3
• Improved polynomial secret-sharing schemes
• Title not available (Why is that?)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• 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
• Quadratic secret sharing and conditional disclosure of secrets
• Upslices, downslices, and secret-sharing with complexity of \(1.5^n\)
• 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
• Cryptography with weights: MPC, encryption and signatures
• Placing conditional disclosure of secrets in the communication complexity universe
• On abelian and homomorphic secret sharing schemes
• Secret sharing lower bound: either reconstruction is hard or shares are long
• Secret sharing with certified deletion
• Succinct computational secret sharing
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
• Optimal linear multiparty conditional disclosure of secrets protocols
• Verification protocol for stable matching from conditional disclosure of secrets
• Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

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)