31 search results - page 4 / 7 » On the Hardness of Information-Theoretic Multiparty Computat... |
ALMOB
2008
13 years 8 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
AMEC
2003
Springer
14 years 1 months ago
2003
Springer
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
WPES
2004
ACM
14 years 1 months ago
2004
ACM
The number of location-aware mobile devices has been rising for several years. As this trend continues, these devices may be able to use their location information to provide inte...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We design efficient protocols for processors to extract private randomness over a network with Byzantine faults, when each processor has access to an independent weakly-random n-...