|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Fall 2010 Using Algorithms to Solve Key Distribution Problem Zhuo Jin 
ABSTRACT Internet censorship is very common and serious in some countries. People in those countries may not access to some websites which are undesirable for the governments of those countries. In order to make every legitimate user in those countries can access Internet freely; we need some methods to bypass the Internet censorship. One of the common ways is to distribute proxies among those users. However, adversarial users may hide themselves among legitimate users, and they can compromise those proxies they received. This paper will discuss how to distribute keys (representing proxies) among users to make sure every legitimate user can receive at least one uncompromised key. This problem can also be called key distribution problem. Key distribution problem is a common problem when we discuss how to use algorithms to fight censorship. This paper will discuss the key distribution problem in two models: static model and dynamic model. After that we will introduce another common way to fight censorship, which called trust networks. Also we will discuss how to solve key distribution problem in trust networks. At last we will list some problems which we can study in the future. |
||||||
|
