534 search results - page 19 / 107 » One more bit is enough |
COCO
2010
Springer
13 years 12 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
CEE
2008
13 years 8 months ago
2008
To adapt the data rate in accordance with the quality of the link, the IEEE 802.11 standard proposes the variable rate shifting functionality. This intrinsic functionality of the ...
COMBINATORICS
2000
13 years 7 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...