Sciweavers

7 search results - page 1 / 2
» Sybilproof transitive trust protocols
Sort
View
SIGECOM
2009
ACM
117views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
Sybilproof transitive trust protocols
We study protocols to enable one user (the principal) to make potentially profitable but risky interactions with another user (the agent), in the absence of direct trust between ...
Paul Resnick, Rahul Sami
INFOCOM
2009
IEEE
13 years 11 months ago
A Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks
Abstract— Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the ...
Raul Landa, David Griffin, Richard G. Clegg, Eleni...
USS
2010
13 years 2 months ago
Idle Port Scanning and Non-interference Analysis of Network Protocol Stacks Using Model Checking
Idle port scanning uses side-channel attacks to bounce scans off of a "zombie" host to stealthily scan a victim IP address and determine if a port is open or closed, or ...
Roya Ensafi, Jong Chun Park, Deepak Kapur, Jedidia...
NDSS
1997
IEEE
13 years 8 months ago
Distributed Authentication in Kerberos Using Public Key Cryptography
In this work we describe a method for fully distributed authentication using public key cryptography within the Kerberos ticket framework. By distributing most of the authenticati...
Marvin A. Sirbu, John C.-I. Chuang
NOSSDAV
2009
Springer
13 years 11 months ago
Probabilistic event resolution with the pairwise random protocol
Peer-to-peer distributed virtual environments (DVE's) distribute state tracking and state transitions. Many DVE's - such as online games - require ways to fairly determi...
John L. Miller, Jon Crowcroft