3134 search results - page 169 / 627 » simulation 2010 |
111
Voted
PKC
2010
Springer
15 years 5 months ago
2010
Springer
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
105
Voted
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--This paper presents a method for automatic microarchitectural pipelining of systems with loops. The original specification is pipelined by performing provably-correct tra...
112
Voted
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
92
Voted
CCGRID
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We propose several algorithms for topology aggregation (TA) to effectively summarize large-scale networks. These TA techniques are shown to significantly better for path ...
124
Voted
CCS
2010
ACM
15 years 3 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...