80 search results - page 3 / 16 » Zero-knowledge from secure multiparty computation |
CRYPTO
2010
Springer
13 years 11 months ago
2010
Springer
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
CRYPTO
2004
Springer
14 years 3 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
CRYPTO
2005
Springer
14 years 3 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...
TIT
2008
13 years 10 months ago
2008
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...