Linear multi-secret sharing schemes based on multi-party computation
From MaRDI portal
Recommendations
- Linear multi-secret sharing schemes
- Multi-linear secret-sharing schemes
- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
- Progress in Cryptology - INDOCRYPT 2003
- General secure multi-party computation from any linear secret-sharing scheme
- Linear threshold multisecret sharing schemes
- Linear threshold multisecret sharing schemes
- A linear construction of secret sharing schemes
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
- Operations over linear secret sharing schemes
Cites work
- scientific article; zbMATH DE number 512874 (Why is no real title available?)
- scientific article; zbMATH DE number 1543059 (Why is no real title available?)
- scientific article; zbMATH DE number 1406777 (Why is no real title available?)
- General secure multi-party computation from any linear secret-sharing scheme
- How to share a secret
- Linear multi-secret sharing schemes
- On secret sharing systems
Cited in
(10)- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
- Verifiable multi-secret sharing based on LFSR sequences
- An ideal multi-secret sharing scheme based on MSP
- On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
- New efficient and practical verifiable multi-secret sharing schemes
- A group identification protocol with leakage resilience of secret sharing scheme
- Linear multi-secret sharing schemes
- New multi-stage secret sharing in the standard model
- General secret sharing based on quantum Fourier transform
This page was built for publication: Linear multi-secret sharing schemes based on multi-party computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998657)