Sciweavers

3130 search results - page 19 / 626
» Collusion without communication
Sort
View
INFOCOM
2009
IEEE
15 years 6 months ago
On Mechanism Design without Payments for Throughput Maximization
—It is well-known that the overall efficiency of a distributed system can suffer if the participating entities seek to maximize their individual performance. Consequently, mecha...
Thomas Moscibroda, Stefan Schmid
PKC
2007
Springer
125views Cryptology» more  PKC 2007»
15 years 5 months ago
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
Takashi Nishide, Kazuo Ohta
INFOCOM
2007
IEEE
15 years 6 months ago
Adaptive Max-Min Fair Scheduling in Buffered Crossbar Switches Without Speedup
— A good crossbar switch scheduler should be able to achieve 100% throughput and maintain fairness among competing flows. A pure input-queued (IQ) non-buffered switch requires a...
Xiao Zhang, Satya Ranjan Mohanty, Laxmi N. Bhuyan
CHES
2007
Springer
157views Cryptology» more  CHES 2007»
15 years 6 months ago
A Hardware-Assisted Realtime Attack on A5/2 Without Precomputations
Abstract. A5/2 is a synchronous stream cipher that is used for protecting GSM communication. Recently, some powerful attacks [2,10] on A5/2 have been proposed. In this contribution...
Andrey Bogdanov, Thomas Eisenbarth, Andy Rupp
IPPS
2006
IEEE
15 years 5 months ago
Oblivious parallel probabilistic channel utilization without control channels
The research interest in sensor nets is still growing because they simplify data acquisition in many applications. If hardware resources are very sparse, routing algorithms cannot...
Christian Schindelhauer