• DocumentCode
    2585663
  • Title

    MuON: epidemic based mutual anonymity

  • Author

    Bansod, Neelesh ; Malgi, Ashish ; Choi, Byung Kyu ; Mayo, Jean

  • Author_Institution
    Dept. of Comput. Sci., Michigan Technol. Univ., Houghton, MI
  • fYear
    2005
  • fDate
    9-9 Nov. 2005
  • Lastpage
    109
  • Abstract
    A mutually anonymous service hides the identity of a client from the service provider and vice-versa. Providing mutual anonymity usually requires a large number of participants. While peer-to-peer (P2P) networks are capable of recruiting a large number of participants, reliable anonymous communication in these architectures, with low bandwidth usage, still needs further investigation. This paper presents MuON, a protocol to achieve mutual anonymity in unstructured P2P networks. MuON leverages epidemic-style data dissemination to deal with the high churn (changes in system membership) characteristic of unstructured P2P networks. The results from our security analysis and simulation show that MuON provides mutual anonymity over unstructured P2P networks while maintaining predictable latencies, high reliability, and low communication overhead
  • Keywords
    computer network reliability; information dissemination; peer-to-peer computing; protocols; telecommunication security; MuON; epidemic-style data dissemination; mutually anonymous service; peer-to-peer network; protocol; reliability; security analysis; unstructured P2P network; Analytical models; Bandwidth; Communication system security; Data security; Mesons; Peer to peer computing; Predictive models; Protocols; Recruitment; Telecommunication network reliability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Protocols, 2005. ICNP 2005. 13th IEEE International Conference on
  • Conference_Location
    Boston, MA
  • Print_ISBN
    0-7695-2437-0
  • Type

    conf

  • DOI
    10.1109/ICNP.2005.26
  • Filename
    1544612