مشخصات پژوهش

Anonymity algorithms try to keep the identity of the individual or user hidden and prevent the disclosure of the individual's information on the network. Therefore, these algorithms can both provide services to the individual and the user and can hide his identity. The importance of these algorithms is very high in location-based services such as online shopping from stores or requesting a telephone taxi service. Because in this type of service, the user's location address must be used, and without these addresses, it will not be possible to provide services or send goods. Because the location address can directly reveal the location of the person and expose him to serious harm, a framework for maintaining anonymity for the user is very crucial. Usually, the location and identity addresses of users are very important and useful for cyber attackers. In this regard, attackers always try to be in a superior position compared to the defender and, by obtaining important and effective information from the defender, plan and execute a successful attack. The attacker's attempt to achieve a successful attack causes the defender to plan to be in a safe position. This means that the attacker and the victim are always in a tough game and competition to defeat their opponent. Accordingly, we can model the competition between the defender and the attacker using game theory and, based on the ideas of this theory, such as the Nash equilibrium principle, always place the defender in a winning position. This thesis focuses on modeling the positions and scenarios of the defender and attacker in network security based on location anonymity and tries to increase the degree of anonymity of the defender and always place the defender in a safe position and location relative to the attacker.