5484 search results - page 61 / 1097 » Almost-Everywhere Secure Computation |
104
click to vote
TIT
2008
14 years 11 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...
CHI
2007
ACM
16 years 8 days ago
2007
ACM
PODC
2010
ACM
15 years 3 months ago
2010
ACM
CORR
2010
Springer
14 years 12 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...
CRYPTO
2000
Springer
15 years 4 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...