Quadratic secret sharing and conditional disclosure of secrets

DOI10.1007/978-3-030-84252-9_25zbMATH Open1489.94116OpenAlexW3192906601MaRDI QIDQ2129018FDOQ2129018

Hussien Othman, Amos Beimel, 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to share a secret
• Multiple assignment scheme for sharing secret
• A note on monotone complexity and the rank of matrices
• The size of a share must be large
• Superpolynomial lower bounds for monotone span programs
• Secret-Sharing Schemes: A Survey
• Lower bounds for monotone span programs
• Protecting data privacy in private information retrieval schemes
• A minimal model for secure computation (extended abstract)
• Secret-sharing schemes for general and uniform access structures
• A characterization of span program size and improved lower bounds for monotone span programs
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
• On the Power of Nonlinear Secret-Sharing
• Dual System Encryption via Predicate Encodings
• Secret Sharing and Statistical Zero Knowledge
• Strongly exponential lower bounds for monotone computation
• The communication complexity of private simultaneous messages, revisited
• Lifting Nullstellensatz to monotone span programs over any field
• Towards breaking the exponential barrier for general secret sharing
• Conditional disclosure of secrets via non-linear reconstruction
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• Breaking the circuit-size barrier in secret sharing
• Optimal linear multiparty conditional disclosure of secrets protocols
• The share size of secret-sharing schemes for almost all access structures and graphs
• Placing conditional disclosure of secrets in the communication complexity universe
• Secret sharing lower bound: either reconstruction is hard or shares are long
• Better secret sharing via robust conditional disclosure of secrets
• Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
• On the Power of Amortization in Secret Sharing

Cited In (2)

• Title not available (Why is that?)
• Improved polynomial secret-sharing schemes

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)