Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
From MaRDI portal
Publication:5451069
DOI10.1007/11593447_9zbMATH Open1154.94480OpenAlexW1799782747MaRDI QIDQ5451069FDOQ5451069
Mu-Lan Liu, Liang Liang Xiao, Zhifang Zhang
Publication date: 18 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11593447_9
Recommendations
- Linear multi-secret sharing schemes based on multi-party computation
- General secure multi-party computation from any linear secret-sharing scheme
- Multi-linear secret-sharing schemes
- Secure multiparty computation and secret sharing
- Linear multi-secret sharing schemes
- Progress in Cryptology - INDOCRYPT 2003
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Multi-party computation with conversion of secret sharing
- Applied Cryptography and Network Security
- Secure multiparty computation with sublinear preprocessing
Cited In (8)
- Applied Cryptography and Network Security
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations
- Parallelizable delegation from LWE
- Progress in Cryptology - INDOCRYPT 2003
- Multi-Party Secure Computation of Multi-Variable Polynomials
- Linear multi-secret sharing schemes based on multi-party computation
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- General secure multi-party computation from any linear secret-sharing scheme
This page was built for publication: Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451069)
