570 search results - page 10 / 114 » Black-box constructions for secure computation |
ICSOC
2005
Springer
14 years 1 months ago
2005
Springer
—Service-oriented computing promotes collaboration by defining the standards layer that allows compatibility between disparate domains. Workflows, by taking advantage of the serv...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
CRYPTO
2003
Springer
14 years 1 months 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...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...