224 search results - page 18 / 45 » Secure Computation from Random Error Correcting Codes |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
For purpose of object recognition, we learn one discriminative classifier based on one prototype, using shape context distances as the feature vector. From multiple prototypes, th...
CLEIEJ
2006
13 years 7 months ago
2006
The proposed software technique is a very low cost and an effective solution towards designing Byzantine fault tolerant computing application systems that are not so safety critic...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
CRYPTO
2003
Springer
14 years 16 days ago
2003
Springer
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...