24 search results - page 2 / 5 » On Codes, Matroids, and Secure Multiparty Computation From L... |
CRYPTO
2006
Springer
13 years 8 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...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
INDOCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
We consider both information-theoretic and cryptographic settings for Multi-Party Computation (MPC), based on the underlying linear secret sharing scheme. Our goal is to study the ...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
EUROCRYPT
2007
Springer
13 years 11 months ago
2007
Springer
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...