Sciweavers

241 search results - page 5 / 49
» On Generating Independent Random Strings
Sort
View
INFOCOM
2012
IEEE
11 years 9 months ago
Link correlation aware opportunistic routing
—By exploiting reception diversity of wireless network links, researchers have shown that opportunistic routing can improve network performance significantly over traditional ro...
Anas Basalamah, Song Min Kim, Shuo Guo, Tian He, Y...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 27 days ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
TIT
2010
61views Education» more  TIT 2010»
13 years 2 months ago
Tunstall code, Khodak variations, and random walks
A variable-to-fixed length encoder partitions the source string into variable-length phrases that belong to a given and fixed dictionary. Tunstall, and independently Khodak, desig...
Michael Drmota, Yuriy A. Reznik, Wojciech Szpankow...
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
13 years 9 months ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz