6251 search results - page 421 / 1251 » Randomness, Computability, and Density |
164
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
161
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We introduce the novel concept of covert two-party computation. Whereas ordinary secure two-party computation only guarantees that no more knowledge is leaked about the inputs of t...
164
click to vote
JCB
1998
15 years 6 months ago
1998
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
177
click to vote
CRYPTO
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...