3134 search results - page 63 / 627 » Computing full disjunctions |
WINE
2007
Springer
14 years 4 months ago
2007
Springer
A function is non-cooperative computable [NCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not bene...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
OSDI
1994
ACM
13 years 11 months ago
1994
ACM
Mobile computers such as notebooks, subnotebooks, and palmtops require low weight, low power consumption, and good interactive performance. These requirements impose many challeng...
JOC
2000
13 years 9 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
LICS
2002
IEEE
14 years 2 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...