Quadratic secret sharing and conditional disclosure of secrets

DOI10.1007/978-3-030-84252-9_25MaRDI QIDQ2129018zbMATH OpenOpenAlexFDO

Authors Amos Beimel, Hussien Othman, Naty Peter

Publication date 22 April 2022

Full work available at URL https://doi.org/10.1007/978-3-030-84252-9_25

zbMATH Keywords

optimal quadratic \(k\)-server CDS protocolspolynomial 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
• Towards breaking the exponential barrier for general secret sharing
• Optimal linear multiparty conditional disclosure of secrets protocols
• Secret-sharing schemes for general and uniform access structures
• Secret-Sharing Schemes: A Survey

Cites work

• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 3825713 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 1024000 (Why is no real title available?)
• scientific article; zbMATH DE number 1101416 (Why is no real title available?)
• scientific article; zbMATH DE number 7759464 (Why is no real title available?)
• A characterization of span program size and improved lower bounds for monotone span programs
• A minimal model for secure computation (extended abstract)
• A note on monotone complexity and the rank of matrices
• Better secret sharing via robust conditional disclosure of secrets
• Breaking the circuit-size barrier in secret sharing
• Communication complexity of conditional disclosure of secrets and attribute-based encryption
• Conditional disclosure of secrets via non-linear reconstruction
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Dual System Encryption via Predicate Encodings
• Dual system encryption via doubly selective security: framework, fully secure functional encryption for regular languages, and more
• How to share a secret
• Lifting Nullstellensatz to monotone span programs over any field
• Lower bounds for monotone span programs
• Multiple assignment scheme for sharing secret
• On the Power of Amortization in Secret Sharing
• On the Power of Nonlinear Secret-Sharing
• Optimal linear multiparty conditional disclosure of secrets protocols
• Placing conditional disclosure of secrets in the communication complexity universe
• Protecting data privacy in private information retrieval schemes
• Secret Sharing and Statistical Zero Knowledge
• Secret sharing lower bound: either reconstruction is hard or shares are long
• Secret-Sharing Schemes: A Survey
• Secret-sharing schemes for general and uniform access structures
• Strongly exponential lower bounds for monotone computation
• Superpolynomial lower bounds for monotone span programs
• The communication complexity of private simultaneous messages, revisited
• The share size of secret-sharing schemes for almost all access structures and graphs
• The size of a share must be large
• Towards breaking the exponential barrier for general secret sharing

Cited in

(5)

• scientific article; zbMATH DE number 5238593 (Why is no real title available?)
• Improved polynomial secret-sharing schemes
• Towards breaking the exponential barrier for general secret sharing
• Simplified PIR and CDS protocols and improved linear secret-sharing schemes
• Optimal linear multiparty conditional disclosure of secrets protocols

This page was built for publication: Quadratic secret sharing and conditional disclosure of secrets

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