Sciweavers

3247 search results - page 118 / 650
» Randomized smoothing networks
Sort
View
SPW
2005
Springer
15 years 9 months ago
Enhancing Privacy with Shared Pseudo Random Sequences
Protecting users’ privacy is essential for turning networks and services into trustworthy friends. Many privacy enhancing techniques, such as anonymous e-cash and mix-nets, have...
Jari Arkko, Pekka Nikander, Mats Näslund
158
Voted
GI
2003
Springer
15 years 9 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner
103
Voted
GLOBECOM
2006
IEEE
15 years 10 months ago
Performance of End-to-End Mobility Management in Satellite IP Networks
— IETF has developed Mobile IP to support mobility of IP hosts at the network layer. The National Aeronautics and Space Administration has implemented Mobile IP to handle handove...
Pulak K. Chowdhury, Mohammed Atiquzzaman, William ...
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 4 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
132
Voted
FOCS
2009
IEEE
15 years 10 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao