Optimal linear multiparty conditional disclosure of secrets protocols

DOI10.1007/978-3-030-03332-3_13zbMath1447.94059OpenAlexW2807891686MaRDI QIDQ1710680

Amos Beimel, Naty Peter

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_13

zbMATH Keywords

secret-sharing schemesconditional disclosure of secrets protocols

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Quadratic secret sharing and conditional disclosure of secrets ⋮ Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations ⋮ Placing conditional disclosure of secrets in the communication complexity universe ⋮ Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA

Cites Work

• Unnamed Item
• Unnamed Item
• Secret-sharing schemes for very dense graphs
• Multiple assignment scheme for sharing secret
• Secret sharing over infinite domains
• Protecting data privacy in private information retrieval schemes
• On the power of amortization in secret sharing: \(d\)-uniform secret sharing and CDS with constant information rate
• Towards breaking the exponential barrier for general secret sharing
• The complexity of multiparty PSM protocols and related models
• Generic transformations of predicate encodings: constructions and applications
• Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
• Conditional disclosure of secrets via non-linear reconstruction
• Linear secret-sharing schemes for forbidden graph access structures
• A minimal model for secure computation (extended abstract)
• Secret Sharing Schemes for Dense Forbidden Graphs
• 2-Server PIR with Sub-Polynomial Communication
• Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
• Universally ideal secret-sharing schemes
• Partial Garbling Schemes and Their Applications
• Breaking the circuit-size barrier in secret sharing
• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More
• On the Cryptographic Complexity of the Worst Functions
• Dual System Encryption via Predicate Encodings
• The communication complexity of private simultaneous messages, revisited

This page was built for publication: Optimal linear multiparty conditional disclosure of secrets protocols