General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
- 12 May 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 316-334
- https://doi.org/10.1007/3-540-45539-6_22
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Foundations of Secure Interactive ComputingPublished by Springer Science and Business Media LLC ,2001
- Efficient Multiparty Computations Secure Against an Adaptive AdversaryLecture Notes in Computer Science, 1999
- Efficient Byzantine agreement secure against general adversariesPublished by Springer Science and Business Media LLC ,1998
- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Published by Springer Science and Business Media LLC ,1998
- Quorum-based secure multi-party computationPublished by Springer Science and Business Media LLC ,1998
- Adaptively secure multi-party computationPublished by Association for Computing Machinery (ACM) ,1996
- Committed Oblivious Transfer and Private Multi-Party ComputationLecture Notes in Computer Science, 1995
- A construction of practical secret sharing schemes using linear block codesLecture Notes in Computer Science, 1993
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985