94 search results - page 2 / 19 » On the complexity of verifiable secret sharing and multipart... |
CRYPTO
2005
Springer
13 years 11 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...
SCN
2010
Springer
13 years 4 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
STOC
2002
ACM
14 years 6 months ago
2002
ACM
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
CRYPTO
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
STOC
2004
ACM
14 years 6 months ago
2004
ACM
