|
|
Methods and possibilities of anonymous communication
Tomisová, Martina ; Beneš, Antonín (advisor) ; Novotný, Miroslav (referee)
The thesis discusses communication methods which provide anonymity to their participants. Basic concepts such as the concept of anonymity are explained in the first part of the thesis. Well known and practically used communication methods and their evaluation techniques are described together with suggestions of a few new methods. The thesis covers both methods that can be called as almost purely theoretical, which can be hardly implemented in the real world, and methods that are widely used in the today's networks. Each method is firstly explained and then evaluated from various aspects of security with regards to the confidentiality of the identity of the users to its practicality and feasibility. Both the possibilities of the attackers and the victims are examined. Last parts of the thesis is devoted to the techniques of evaluation of the communication methods. This problem is nontrivial since the methods differ from each other quite much and hence it is hard to find metrics that would match them all. Such a general metric is not invented in the thesis, at least not a computationally simple one. The conclusion of the thesis attempts to summarize the possibilities and limits of anonymous communication and its evaluation.
|
|
|
Distributed Sytem for Verification of Properties of Natural Numbers
Tomisová, Martina ; Mírovský, Jiří (advisor) ; Peterek, Nino (referee)
The result of my work is a system for distributed verification of properties of natural numbers. It has two parts - server and client. These communicate via HTTP protocol. The clients perform the computation, the server distributes the work (numbers) and gather results (properties of the given numbers). The input of one computation should be one natural number, as well as the result (output). The distribution can be used for verification of a given property for several natural numbers. Particular jobs can be added to the client as plugins. Two examples of plugins are a part of the work. The first one is very simple and shows how to create plugins. The second example searches for prime numbers (and has it's own arithmetics library for long numbers) - the server can distribute (possibly big) numbers, the client will verify whether a given number is a prime number.
|
|
|
Methods and possibilities of anonymous communication
Tomisová, Martina ; Novotný, Miroslav (referee) ; Beneš, Antonín (advisor)
The thesis discusses communication methods which provide anonymity to their participants. Basic concepts such as the concept of anonymity are explained in the first part of the thesis. Well known and practically used communication methods and their evaluation techniques are described together with suggestions of a few new methods. The thesis covers both methods that can be called as almost purely theoretical, which can be hardly implemented in the real world, and methods that are widely used in the today's networks. Each method is firstly explained and then evaluated from various aspects of security with regards to the confidentiality of the identity of the users to its practicality and feasibility. Both the possibilities of the attackers and the victims are examined. Last parts of the thesis is devoted to the techniques of evaluation of the communication methods. This problem is nontrivial since the methods differ from each other quite much and hence it is hard to find metrics that would match them all. Such a general metric is not invented in the thesis, at least not a computationally simple one. The conclusion of the thesis attempts to summarize the possibilities and limits of anonymous communication and its evaluation.
|
|
|
Distributed Sytem for Verification of Properties of Natural Numbers
Tomisová, Martina ; Peterek, Nino (referee) ; Mírovský, Jiří (advisor)
The result of my work is a system for distributed verification of properties of natural numbers. It has two parts - server and client. These communicate via HTTP protocol. The clients perform the computation, the server distributes the work (numbers) and gather results (properties of the given numbers). The input of one computation should be one natural number, as well as the result (output). The distribution can be used for verification of a given property for several natural numbers. Particular jobs can be added to the client as plugins. Two examples of plugins are a part of the work. The first one is very simple and shows how to create plugins. The second example searches for prime numbers (and has it's own arithmetics library for long numbers) - the server can distribute (possibly big) numbers, the client will verify whether a given number is a prime number.
|
guest ::
