Sciweavers

PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 14 days ago
On the Feasibility of Consistent Computations
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
Sven Laur, Helger Lipmaa
NDSS
2009
IEEE
14 years 3 months ago
SybilInfer: Detecting Sybil Nodes using Social Networks
SybilInfer is an algorithm for labelling nodes in a social network as honest users or Sybils controlled by an adversary. At the heart of SybilInfer lies a probabilistic model of h...
George Danezis, Prateek Mittal