562 search results - page 5 / 113 » Secure Multiparty Computation with General Interaction Patte... |
102
click to vote
PROVSEC
2009
Springer
15 years 10 months ago
2009
Springer
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
146
Voted
TIT
2008
15 years 3 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...
117
click to vote
STOC
2007
ACM
16 years 4 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...
114
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
166
Voted
CRYPTO
2005
Springer
15 years 9 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...