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.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This paper describes new technical challenges that arise from networking dynamical systems. In particular, the paper takes a look at the underlying phenomena and the resulting modeling problems that arise in such systems. Special emphasis is placed on the problem of synchronization, since this problem has not received as much attention in the literature as the phenomena of packet drop, delays, etc. The paper then discusses challenges arising in prominent areas such as congestion control, sensor networks, as well as vehicle networks and swarms.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.