Sciweavers

321 search results - page 15 / 65
» Randomness extractors -- applications and constructions
Sort
View
TC
2008
13 years 8 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
MIR
2005
ACM
140views Multimedia» more  MIR 2005»
14 years 2 months ago
Multiple random walk and its application in content-based image retrieval
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying M...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 10 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
ASIACRYPT
2003
Springer
14 years 1 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...