Earticle

초록

영어

With the development of Internet technology, network based activities such as e-commerce, internet voting and e-government, etc. have become increasingly frequent, People are increasingly concerned about the identity of network activity, content and other private information. In order to protect user privacy in network communications, governments, companies, universities and research institutes are pushing the research and development of the onion routing systems (TOR). Tor is the most popular anonymous communication system currently, which is based on technology of the second-generation onion routing. Tor has a low latency, encrypted data transmission, secure channel, etc., which are widely used in anonymous Web browsing, instant messaging, Secure Shell Client (SSH), etc. However, the development of the onion routing systems is constrained by complicated code factors. According to this situation, this paper put forward an overall architecture of TOR code, which contains Application Needs, Code Analysis and Improvement. This paper summarizes the overall framework of tor code structure, in order to make the code structure clearer, the whole code module is divided into several sub modules, using the function call diagram and UML diagram illustrates the main function of each module and call relation between each module. This paper gives code analysis for anonymous architecture of TOR. Finally, this paper put forward the improvement of routing algorithms of TOR. Based on this paper, a method has been created which is used to understand the tor code easily. Furthermore, systematic analysis of the tor code provided in this paper aims to research the working principle and promote the further development of the onion routing.

목차

Abstract
 1. Introduction
 2. The Entry of the Program
  2.1. The do_main_loop function
  2.2. The tor_init Function
 3. The Establishment of the Link
 4. The Transmission of Encrypted Data
 5. The Routing Algorithms of Tor
  5.1. Routing Algorithm I: Selection Entry Node for the Path
  5.2. Routing Algorithm II: Selection Middle Node for the Path
  5.3. Routing Algorithm III: Selection Exit Node for the Path
 6. The Improvement of Routing Algorithm
 7. Conclusion
 Acknowledgements
 References

키워드

저자

• Tianbo Lu [ School of Software Engineering, Beijing University of Posts and Telecommunications, 100876, Beijing, China ]
• Youwen Wang [ School of Software Engineering, Beijing University of Posts and Telecommunications, 100876, Beijing, China ]
• Lingling Zhao [ School of Software Engineering, Beijing University of Posts and Telecommunications, 100876, Beijing, China ]
• Yang Lin [ School of Software Engineering, Beijing University of Posts and Telecommunications, 100876, Beijing, China ]
• Xiaoyan Zhang [ School of Software Engineering, Beijing University of Posts and Telecommunications, 100876, Beijing, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605