764 search results - page 58 / 153 » Reputable Mix Networks |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
The problem of anonymous networking when an eavesdropper observes packet timings in a communication network is considered. The goal is to hide the identities of source-destination...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
CPC
2007
13 years 7 months ago
2007
d Abstract) Colin Cooper∗ , Martin Dyer† and Catherine Greenhill‡ We consider a simple Markov chain for d-regular graphs on n vertices, and show that the mixing time of this...
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
Reputation-based mechanisms and policies are vulnerable to the submission of untruthful ratings. In this paper, we define and analyze a game-theoretic model that captures the dyn...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
1 Service discovery protocols are used in distributed systems to locate services for clients. The services that are located as well as the clients requesting service are commonly a...