41 search results - page 3 / 9 » Reducing the Complexity in the Distributed Multiplication Pr... |
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
MOBIMEDIA
2007
13 years 9 months ago
2007
— The error prone nature of wireless links often necessitates the use of a link layer protocol to ensure acceptable application performance. While traditional link layers assume ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
ASPLOS
1996
ACM
14 years 13 hour ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...