Secret-sharing schemes for general and uniform access structures

DOI10.1007/978-3-030-17659-4_15MaRDI QIDQ2292702zbMATH OpenOpenAlexFDO

Authors Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, Naty Peter

Publication date 4 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17659-4_15

zbMATH Keywords

ad-hoc PSM protocolslinear secret-sharing schemes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Breaking the circuit-size barrier in secret sharing
• scientific article; zbMATH DE number 176543
• Secret-Sharing Schemes: A Survey
• On the size of shares for secret sharing schemes
• Linear Threshold Secret-Sharing with Binary Reconstruction

Cited in

(37)

• On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
• Generation of key predistribution schemes using secret sharing schemes
• On abelian and homomorphic secret sharing schemes
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Upslices, downslices, and secret-sharing with complexity of 1.5ⁿ
• Quadratic secret sharing and conditional disclosure of secrets
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• Multi-party PSM, revisited: improved communication and unbalanced communication
• Secret sharing schemes with bipartite access structure
• An efficient and secure multi-secret sharing scheme with general access structures
• scientific article; zbMATH DE number 708832 (Why is no real title available?)
• scientific article; zbMATH DE number 1955808 (Why is no real title available?)
• scientific article; zbMATH DE number 1390062 (Why is no real title available?)
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• scientific article; zbMATH DE number 5053300 (Why is no real title available?)
• scientific article; zbMATH DE number 5059265 (Why is no real title available?)
• Secret sharing schemes for ports of matroids of rank 3.
• Public Key Cryptography - PKC 2006
• Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
• Linear Threshold Secret-Sharing with Binary Reconstruction
• Cryptography with weights: MPC, encryption and signatures
• Succinct computational secret sharing
• Verification protocol for stable matching from conditional disclosure of secrets
• Improved polynomial secret-sharing schemes
• Secret sharing with certified deletion
• Fully anonymous secret sharing
• (k, n)-consecutive access structures
• Low-degree security of the planted random subgraph problem
• Secret-sharing schemes for high slices
• New upper bounds for evolving secret sharing via infinite branching programs
• 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
• Traceable secret sharing schemes for general access structures
• Secret sharing, slice formulas, and monotone real circuits
• Generalised cumulative arrays in secret sharing

This page was built for publication: Secret-sharing schemes for general and uniform access structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292702)