Design and analysis of two-layer anonymous communication system
- 27 Downloads
A new architecture for scalable anonymous communication system(SACS) was proposed. The users were divided into several subgroups managed by different sub-blenders, and all sub-blenders were managed by the main-blender using two layers management scheme. The identity information of members are distributed on different sub-blenders, which makes each member keep much less information and network overload greatly reduce. The anonymity and the overhead of the new scheme were analyzed and compared with that of Crowds, which shows the cost of storage and network overhead for the new scheme largely decreases while the anonymity is little degraded. The experiment results also show that the new system architecture is well scalable. The ratio of management cost of SACS to that of Crowds is about 1:25 while the value of P(IsvH1+) only increases by 0.001–0.020, which shows that SACS keeps almost the same anonymity with Crowds.
Key wordsscalability anonymity performance analysis communication system
Unable to display preview. Download preview PDF.
- BERTHOLD O, FEDERRATH H, K OPSELL S. Web MIXes: A system for anonymous and unobservable internet access[C]// Workshop on Design Issues in Anonymity and Unobservability. Heidelberg: Springer-Verlag Press, 2001: 115–129.Google Scholar
- DINGLEDINE R, MATHEWSON N, SYVERSON P. Tor: The second-generation onion router[C]// Proceeding of the 13th USENIX Security Symposium. San Diego: ACM Press, 2004: 303–320.Google Scholar
- MURDOCH S J. DANEZIS G. Low-cost traffic analysis of tor[C]// IEEE Symposium on Security and Privacy. Oakland: IEEE Computer Soc, 2005: 183–195.Google Scholar
- GOEL S, ROBSON M, POLTE M, et al. Herbivore: A scalable and efficient protocol for anonymous communication[R]. Computing and Information Science Technical Report TR2003-1890, Cornell University, 2003–04.Google Scholar
- SHERWOOD R, BHATTACHARJEE B, SRINIVASAN A. P5: A protocol for scalable anonymous communication[C]// IEEE Symposium on Security and Privacy. Oakland: IEEE Computer Society Press, 2002: 58–70.Google Scholar
- FREEDMAN M, MORRIS R. Tarzan: A peer-to-peer anonymizing network layer[C]// The 9th ACM Conference on Computer and Communications Security. Washington, DC: ACM Press, 2002: 193–206.Google Scholar
- WANG Wei-ping, CHEN Jian-er, WANG Jian-xin. An anonymous communication protocol based on groups with definite route length[J]. Journal of Computer Research and Development, 2003, 40(4): 609–614. (in Chinese)Google Scholar
- SUI Hong-fei, CHEN Song-qiao, CHEN Jian-er. Decreased forwarding probability based length control strategy of crowds[J]. Mini-micro Systems, 2005, 26(3): 387–391.Google Scholar
- SUI H F, WANG J X, CHEN J E, et al. An analysis of Forwarding Mechanism in Crowds[C]//IEEE International Conference on Communications. Anchorage: Institute of Electrical and Electronics Engineers Computer Society, 2003: 261–265.Google Scholar