94 search results - page 5 / 19 » On the complexity of verifiable secret sharing and multipart... |
INDOCRYPT
2003
Springer
14 years 1 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 ...
IACR
2011
12 years 8 months ago
2011
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Secret sharing and multiparty computation (also called “secure function evaluation”) are fundamental primitives in modern cryptography, allowing a group of mutually distrustfu...
CRYPTO
2009
Springer
14 years 3 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
EUROCRYPT
2005
Springer
14 years 2 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 ...