Sciweavers

6907 search results - page 652 / 1382
» Securing distributed adaptation
Sort
View
ESORICS
2009
Springer
16 years 7 months ago
The Wisdom of Crowds: Attacks and Optimal Constructions
We present a traffic analysis of the ADU anonymity scheme presented at ESORICS 2008, and the related RADU scheme. We show that optimal attacks are able to de-anonymize messages mor...
Carmela Troncoso, Claudia Díaz, Emilia K&au...
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
16 years 7 months ago
On the composition of authenticated byzantine agreement
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
PERCOM
2008
ACM
16 years 6 months ago
A tamper-proof and lightweight authentication scheme
We present a tamper-proof and lightweight challenge-response authentication scheme based on 2-level noisy Physically Unclonable Functions (PUF). We present a security reduction, w...
Ghaith Hammouri, Erdinç Öztürk, Berk Sunar
ICDCS
2009
IEEE
16 years 4 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu
CSE
2009
IEEE
16 years 2 months ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings