ДОСЛІДЖЕННЯ МОДЕЛЕЙ АНОНІМНОЇ МАРШРУТИЗАЦІЇ

Abstract

Numerous solutions have been created for online anonymous communication. We do evaluations of security on several systems. We examine features such as Onion Routing, anonymous VPN services, probabilistic anonymity, and deterministic anonymity among different systems. There are also additional forms of anonymous communication that are discussed, including messaging, peer-to-peer communication, using the web, emailing, and using other Internet apps. We then go on to show several attack methods that aim to identify people who communicate anonymously. The objective of the research is to achieve an exact adjust between guaranteeing the adequacy and dependability of message delivery and ensuring customer anonymity. The NIAR model's non-interactive highlight makes it more valuable since it licenses secure communication without requiring nonstop client support. Communication privacy is threatened by an ever-growing volume of data generated by an ever-growing number of networked devices. Because of this, Anonymous Communication Systems (ACSs)—which offer the privacy qualities of anonymity, unsinkability, and observability—are recommended to conceal the relationship between transmitted communications and their senders and recipients. The objective of this essay is to evaluate the literature on Dining Cryptographers Networks (DCNs) in the subject of ACSs. Since the DCN-based techniques offer unconditional guarantees of observability, they are information-theoretically safe. Their computation and communication expense was considered high at the time, and scalability issues arose, which originally impeded their use for anonymous communications. By satisfying these targets, the research improves the state of encrypted communication systems and opens the door to a day when protecting client security will be a best need without sacrificing message delivery's significant dependability and efficiency.