Affiliation:
1. Institute of Computing Science Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
Abstract
Abstract
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.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Risk Mechanism and Supervision of P2P Lending Asset Securitization Under the Background of Big Data;2021 International Conference on Big Data Analytics for Cyber-Physical System in Smart City;2022
2. A decentralized group signature scheme for privacy protection in a blockchain;International Journal of Applied Mathematics and Computer Science;2021
3. Data Replication Based on Common Interests in P2P Social Networks;2018 IEEE 11th Conference on Service-Oriented Computing and Applications (SOCA);2018-11
4. A column generation technique for routing and spectrum allocation in cloud–ready survivable elastic optical networks;International Journal of Applied Mathematics and Computer Science;2017-09-01
5. Anonymous Fair Exchange Protocol with a Semitrusted Third Party;2017 IEEE Second International Conference on Data Science in Cyberspace (DSC);2017-06