Welcome to the resource topic for 2005/132
Formal Notions of Anonymity for Peer-to-peer Networks
Authors: Jiejun KongAbstract:
Providing anonymity support for peer-to-peer (P2P) overlay networks is
critical. Otherwise, potential privacy attacks (e.g., network address
traceback) may deter a storage source from providing the needed data.
In this paper we use this practical application scenario to verify our
observation that network-based anonymity can be modeled as a complexity
based cryptographic problem. We show that, if the routing process
between senders and recipients can be modeled as abstract entities,
network-based anonymity becomes an analogy of cryptography. In
particular, perfect anonymity facing an unbounded traffic analyst
corresponds to Shannon’s perfect secrecy facing an unbounded
cryptanalyst. More importantly, in this paper we propose Probabilistic
Polynomial Route (PPR) model, which is a new polynomially-bounded
anonymity model corresponding to the Probabilistic Polynomial Time
(PPT) model in cryptography. Afterwards, network-based anonymity
attacks are with no exception in BPP. This phenomenon has not been
discovered in previous anonymity research.
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .