Sciweavers

18090 search results - page 371 / 3618
» Computing by Only Observing
Sort
View
FOCS
2003
IEEE
16 years 40 min ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
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...
Rafael Pass, Alon Rosen
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
15 years 12 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
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...
Salil P. Vadhan
FTDCS
1999
IEEE
15 years 11 months ago
PODC: Paradigm-Oriented Distributed Computing
We describe an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigmoriented distributed computing (PODC) is that the...
Hairong Kuang, Lubomir Bic, Michael B. Dillencourt...
POPL
1997
ACM
15 years 11 months ago
Synchronization Transformations for Parallel Computing
As parallel machines become part of the mainstream computing environment, compilers will need to apply synchronization optimizations to deliver e cient parallel software. This pap...
Pedro C. Diniz, Martin C. Rinard
CLIMA
2010
15 years 6 months ago
Is Computational Complexity a Barrier to Manipulation?
When agents are acting together, they may need a simple mechanism to decide on joint actions. One possibility is to have the agents express their preferences in the form of a ballo...
Toby Walsh