5665 search results - page 90 / 1133 » Introduction to Computer Security |
120
click to vote
EUROCRYPT
2010
Springer
15 years 7 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
130
click to vote
TIT
2008
15 years 2 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...
103
Voted
CHI
2007
ACM
16 years 2 months ago
2007
ACM
PODC
2010
ACM
15 years 6 months ago
2010
ACM
84
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...