Atomic Secure Multi-party Multiplication with Low Communication
Authors:
- Robbert de HaanRHRobbert de Haan
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 329-346
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields2006
- Secure Distributed Linear Algebra in a Constant Number of Rounds2001
- Robustness for Free in Unconditional Multi-party ComputationLecture Notes in Computer Science, 2001
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography1998
- A complexity theory of efficient parallel algorithmsTheoretical Computer Science, 1990
- How to share a secretCommunications of the ACM, 1979