Optimal linear multiparty conditional disclosure of secrets protocols
From MaRDI portal
Recommendations
- Conditional disclosure of secrets via non-linear reconstruction
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Quadratic secret sharing and conditional disclosure of secrets
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Breaking the circuit-size barrier in secret sharing
Cites work
- A minimal model for secure computation (extended abstract)
- 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 doubly selective security: framework, fully secure functional encryption for regular languages, and more
- Dual System Encryption via Predicate Encodings
- General secure multi-party computation from any linear secret-sharing scheme
- Generic transformations of predicate encodings: constructions and applications
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- Linear secret-sharing schemes for forbidden graph access structures
- Multiple assignment scheme for sharing secret
- On the Cryptographic Complexity of the Worst Functions
- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Partial garbling schemes and their applications
- Protecting data privacy in private information retrieval schemes
- Secret sharing over infinite domains
- Secret sharing schemes for dense forbidden graphs
- Secret-sharing schemes for very dense graphs
- The communication complexity of private simultaneous messages, revisited
- The complexity of multiparty PSM protocols and related models
- Towards breaking the exponential barrier for general secret sharing
- Universally ideal secret-sharing schemes
Cited in
(16)- On the power of amortization in secret sharing: d-uniform secret sharing and CDS with constant information rate
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Conditional disclosure of secrets via non-linear reconstruction
- Placing conditional disclosure of secrets in the communication complexity universe
- Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
- Quadratic secret sharing and conditional disclosure of secrets
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Communication complexity of conditional disclosure of secrets and attribute-based encryption
- A New Protocol for Conditional Disclosure of Secrets and Its Applications
- Optimal Secret Protections in Discrete-Event Systems
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- Verification protocol for stable matching from conditional disclosure of secrets
- Improved polynomial secret-sharing schemes
- Secret-sharing schemes for high slices
- Simplified PIR and CDS protocols and improved linear secret-sharing schemes
- On the communication complexity of PSM and CDS for symmetric functions
This page was built for publication: Optimal linear multiparty conditional disclosure of secrets protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1710680)
