Anonymity in Network Communication Right To Be Anonymous When We Need to Be Anonymous The Current Situation and Where We Start Mix Networks Definition of Mix Network Classification of Mix Networks Decryption Chain or Re-encryption General or Separate Verification Tag Attached to Input Summary Efficient and Secure GMN: a Simple and Efficient Solution The GMN in  Analysis and Summary Efficient and Secure SMN: the Most Important Mix Network SMN Employing Multiplicative Homomorphic Encryption Algorithm SMN Employing Additive Homomorphic Encryption Algorithm Grouped Shuffling: a Trade-off to Improve Efficiency of Mix Networks Group Shuffling in  Another Grouped Shuffling Protocol to Support Efficient SMN Survey and Analysis of SMN The Assumptions Needed in the Mix Networks in  and  Security Concerns in  and  Failure in Functionality of the Mix Network by Wikstrom Efficiency of SMN: Claim and Reality Unfair Usage of Short Exponents Other Unfair Factors in Efficiency Claim and Comparison Re-evaluating Efficiency Summary Application of Mix Network to E-Voting: A Case Study Mix Network for E-Voting The Recent Mix Network Schemes The New Mix Network Security and Efficiency Analysis Extension and Application Mix Network-Based E-Voting Security Concerns and Suggested Solution in Practice Various Relation Attacks and the Existing Countermeasures Main Idea of the New Countermeasure A Prototype and Its Drawbacks Optimization and Security Analysis Off-Line Pre-Computation in Mix Networks Security Model of Shuffles The Basic Design Off-Line Pre-Computation and Batch Verification The Final Shuffling Protocol:Modifying Encryption and Further Improving Efficiency Comparison and Conclusion Onion Routing The Basic Idea Formal Definition of Security Second Generation: Tor Design of Tor Application of Symmetric Cipher and Diffie-Hellman Key Exchange in Tor: Efficiency Improvement Optimisation and Practical Application of Onion Routing Verifiable TOR: a Verifiable Application of Onion Routing Preliminaries Advanced Tor with a Verification Mechanism Efficiency Improvment Using Diffie-Hellman Chain A Simple Optimisation of Tor and its Drawback: Simpler but Still Direct Application of Diffie-Hellman Key Exchange A New and More Advanced Technique: Diffie-Hellman Chain Analysis and Comparison Further Optimisation: Small Compressed Onion Routing A Practical Application: Paid and Anonymous Use Of Cloud Softwares How to Obtain Anonymous Usage Permit of a Cloud Software: Anonymous Token Two-Way Onion Routing to Support Anonymous Usage of Cloud Software Efficiency Optimisation: Two-Way Onion Routing with Compact Diffie-Hellman Handshakes Security Analysis Practical Systems to Achieve Anonymity: How to Use Them Installation and Usage of Tor Download and Installation Configuration Installation and Usage of I2P Download and Installation Configuration Installation and Usage of JAP/JonDo Download and Installation Configuration Installation and Usage of Quicksilver Download and Installation Configuration References Index
Dr. Kun Peng received his bachelor's degree in software and master's degree in computer security from Huazhong University of Science and Technology, China. He graduated from the Information Security Institute, Queensland University of Technology, Australia, in 2004, obtaining his PhD degree in information security. His main research interest is in applied public key cryptology. His main research interests include applied cryptology, network security, secure e-commerce, and e-government.