Sybil attacks have been shown to be unpreventable except under the protection of a vigilant central authority. We use an economic analysis to show quantitatively that some applicat...
Recommendation systems can be attacked in various ways, and the ultimate attack form is reached with a sybil attack, where the attacker creates a potentially unlimited number of s...
Haifeng Yu, Chenwei Shi, Michael Kaminsky, Phillip...
We present a scheme based on the Blom scheme for resisting the Sybil type attacks. In this scheme, the authority pre-distributes the combination of the secret used in the Blom sche...
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
George Danezis, Chris Lesniewski-Laas, M. Frans Ka...
Abstract. We propose a novel approach for quantifying a system's resistance to unknown-message side-channel attacks. The approach is based on a measure of the secret informati...