224 search results - page 28 / 45 » Secure Computation from Random Error Correcting Codes |
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
SOSP
2001
ACM
14 years 4 months ago
2001
ACM
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
MMSEC
2004
ACM
14 years 23 days ago
2004
ACM
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
FOCS
2003
IEEE
14 years 19 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...