876 search results - page 160 / 176 » Limits on the Usefulness of Random Oracles |
118
Voted
IPPS
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
129
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: As one of the most widely used parsimony methods for ancestral reconstruction, the Fitch method minimizes the total number of hypothetical substitutions along all bran...
134
Voted
CRYPTO
2011
Springer
14 years 15 days ago
2011
Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of sidechannel attacks. Specifically, we consider a setting where a cheating verifier is allow...
132
Voted
WCNC
2008
IEEE
15 years 7 months ago
2008
IEEE
—This paper provides analytical expressions to evaluate the performance of a random access wireless network in terms of user throughput and network throughput, subject to the con...
107
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...