Sciweavers

530 search results - page 44 / 106
» Universal randomized switching
Sort
View
COMPSEC
2004
131views more  COMPSEC 2004»
15 years 5 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
CN
2010
121views more  CN 2010»
15 years 2 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
15 years 12 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
147
Voted
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 years 5 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
182
Voted
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 5 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra