Sciweavers

3702 search results - page 631 / 741
» All Pairings Are in a Group
Sort
View
IPL
2006
110views more  IPL 2006»
15 years 6 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
JNW
2008
115views more  JNW 2008»
15 years 6 months ago
On the Interaction Between Multiple Paths and Wireless Mesh Networks Scheduler Approaches
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
Valeria Loscrì
JSAC
2008
101views more  JSAC 2008»
15 years 6 months ago
Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing
We study a sequential auction for sharing a wireless resource (bandwidth or power) among competing transmitters. The resource is assumed to be managed by a spectrum broker (auction...
Junjik Bae, Eyal Beigman, Randall A. Berry, Michae...
JUCS
2008
156views more  JUCS 2008»
15 years 6 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
ECCC
2007
86views more  ECCC 2007»
15 years 6 months ago
Testing Halfspaces
This paper addresses the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(w·x−θ). We consider halfspaces over the ...
Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, R...