Skip to main content
Article thumbnail
Location of Repository

A branch hash function as a method of message synchronization in anonymous P2P conversations

By Kobusińska Anna, Brzeziński Jerzy, Boroń Michał, Inatlewski Łukasz, Jabczyński Michał and Maciejewski Mateusz


Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon-a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved. In the paper, the formal definition of the proposed hash branch function and the proof of its efficiency are presented

Topics: peer-to-peer, synchronization, conversations, anonymity, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
Publisher: De Gruyter Open
Year: 2016
DOI identifier: 10.1515/amcs-2016-0034
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.