Breaking the circuit-size barrier in secret sharing

DOI10.1145/3188745.3188936zbMath1428.94108OpenAlexW2809318426MaRDI QIDQ5230331

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

zbMATH Keywords

secret sharinginformation-theoretic cryptography

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (18)

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 ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ 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 ⋮ Probabilistic secret sharing ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs ⋮ Unnamed Item ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ On abelian and homomorphic secret sharing schemes ⋮ Unnamed Item ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA ⋮ Secret sharing schemes for ports of matroids of rank 3 ⋮ 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