2996 search results - page 427 / 600 » Numberings and Randomness |
155
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...
166
click to vote
IS
2010
15 years 5 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
211
click to vote
PROPERTYTESTING
2010
15 years 4 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
224
click to vote
VTC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
187
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...