Sciweavers

2735 search results - page 117 / 547
» Comparing notions of randomness
Sort
View
LCN
2007
IEEE
14 years 4 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
GLOBECOM
2007
IEEE
14 years 4 months ago
An Exact Solution to an Approximated Model of RED
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
Claus Bauer, Homayoun Yousefi'zadeh, Hamid Jafarkh...
TGC
2007
Springer
14 years 4 months ago
Formal Approaches to Information-Hiding (Tutorial)
Abstract. In this survey paper we consider the class of protocols for informationhiding which use randomization to obfuscate the link between the observables and the information to...
Romain Beauxis, Konstantinos Chatzikokolakis, Catu...
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 10 months ago
Kolmogorov complexity in perspective
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...
Marie Ferbus-Zanda, Serge Grigorieff