Muutke küpsiste eelistusi

E-raamat: Anonymous Communication Networks: Protecting Privacy on the Web

  • Formaat: 203 pages
  • Ilmumisaeg: 10-Apr-2014
  • Kirjastus: Auerbach
  • Keel: eng
  • ISBN-13: 9781439881606
  • Formaat - PDF+DRM
  • Hind: 75,40 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 203 pages
  • Ilmumisaeg: 10-Apr-2014
  • Kirjastus: Auerbach
  • Keel: eng
  • ISBN-13: 9781439881606

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

In todays interactive network environment, where various types of organizations are eager to monitor and track Internet use, anonymity is one of the most powerful resources available to counterbalance the threat of unknown spectators and to ensure Internet privacy.

Addressing the demand for authoritative information on anonymous Internet usage, Anonymous Communication Networks: Protecting Privacy on the Web examines anonymous communication networks as a solution to Internet privacy concerns. It explains how anonymous communication networks make it possible for participants to communicate with each other without revealing their identities.

The book explores various anonymous communication networks as possible solutions to Internet privacy concernsmaking it ideal for network researchers and anyone interested in protecting their privacy or the privacy of their users. Identifying specific scenarios where it is best to be anonymous, it details the two main approaches to anonymous communication networks: onion routing and mixed networks.















Details helpful tips for optimizing onion routing





Defines and classifies mixed networks





Illustrates the application of a mixed network to e-voting with a case study





Considers the application of symmetric cipher and Diffie-Hellman key exchange in Tor





Supplies detailed guidance on how to download and install Tor, I2P, JAP/JonDo, and QuickSilver











Using examples and case studies, the book illustrates the usefulness of anonymous communication networks for web browsing, email, e-banking, and e-voting. It explains how to obtain anonymous usage permits for cloud software and analyzes the spectrum of existing techniques for anonymous cyber surfing. The text concludes by examining future directions to supply you with the understanding required to ensure anonymous Internet browsing.
1 Anonymity in Network Communication 1(14)
1.1 Right to Be Anonymous
2(6)
1.2 When We Need to Be Anonymous
8(2)
1.3 The Current Situation and Where We Start
10(5)
2 Mix Networks 15(48)
2.1 Definition of Mix Network
16(1)
2.2 Classification of Mix Networks
17(5)
2.2.1 Decryption Chain or Re-encryption
17(2)
2.2.2 General or Separate Verification
19(2)
2.2.3 Tag Attached to Input
21(1)
2.2.4 Summary
22(1)
2.3 Efficient and Secure GMN: a Simple and Efficient Solution
22(5)
2.3.1 The GMN in [ 92]
24(2)
2.3.2 Analysis and Summary
26(1)
2.4 Efficient and Secure SMN: the Most Important Mix Network
27(11)
2.4.1 SMN Employing Multiplicative Homomorphic Encryption Algorithm
32(3)
2.4.2 SMN Employing Additive Homomorphic Encryption Algorithm
35(3)
2.5 Grouped Shuffling: a Trade-off to Improve Efficiency of Mix Networks
38(11)
2.5.1 Group Shuffling in [ 93]
39(5)
2.5.2 Another Grouped Shuffling Protocol to Support Efficient SMN
44(5)
2.6 Survey and Analysis of SMN
49(8)
2.6.1 The Assumptions Needed in the Mix Networks in [ 51] and [ 52]
50(3)
2.6.2 Security Concerns in [ 90] and [ 102]
53(2)
2.6.3 Failure in Functionality of the Mix Network by Wikstrom
55(2)
2.7 Efficiency of SMN: Claim and Reality
57(4)
2.7.1 Unfair Usage of Short Exponents
58(1)
2.7.2 Other Unfair Factors in Efficiency Claim and Comparison
59(1)
2.7.3 Re-evaluating Efficiency
59(2)
2.8 Summary
61(2)
3 Application of Mix Network to E-Voting: a Case Study 63(52)
3.1 Mix Network for E-Voting
63(15)
3.1.1 The Recent Mix Network Schemes
64(2)
3.1.2 The New Mix Network
66(6)
3.1.3 Security and Efficiency Analysis
72(4)
3.1.4 Extension and Application
76(2)
3.2 Mix Network-Based E-Voting
78(3)
3.3 Security Concerns and Suggested Solution in Practice
81(18)
3.3.1 Various Relation Attacks and the Existing Countermeasures
83(5)
3.3.2 Main Idea of the New Countermeasure
88(3)
3.3.3 A Prototype and Its Drawbacks
91(2)
3.3.4 Optimization and Security Analysis
93(6)
3.4 Off-Line Pre-Computation in Mix Networks
99(16)
3.4.1 Security Model of Shuffles
102(1)
3.4.2 The Basic Design
103(3)
3.4.3 Off-Line Pre-Computation and Batch Verification
106(2)
3.4.4 The Final Shuffling Protocol: Modifying Encryption and Further Improving Efficiency
108(3)
3.4.5 Comparison and Conclusion
111(4)
4 Onion Routing 115(22)
4.1 The Basic Idea
115(2)
4.2 Formal Definition of Security
117(7)
4.3 Second Generation: Tor
124(13)
4.3.1 Design of Tor
127(6)
4.3.2 Application of Symmetric Cipher and Diffie-Hellman Key Exchange in Tor: Efficiency Improvement
133(4)
5 Optimisation and Practical Application of Onion Routing 137(28)
5.1 Verifiable TOR: a Verifiable Application of Onion Routing
137(5)
5.1.1 Preliminaries
138(1)
5.1.2 Advanced Tor with a Verification Mechanism
139(3)
5.2 Efficiency Improvment Using Diffie-Hellman Chain
142(9)
5.2.1 A Simple Optimisation of Tor and its Drawback: Simpler but Still Direct Application of Diffie-Hellman Key Exchange
143(1)
5.2.2 A New and More Advanced Technique: Diffie-Hellman Chain
144(3)
5.2.3 Analysis and Comparison
147(1)
5.2.4 Further Optimisation: Small Compressed Onion Routing
148(3)
5.3 A Practical Application: Paid and Anonymous Use of Cloud Softwares
151(14)
5.3.1 How to Obtain Anonymous Usage Permit of a Cloud Software: Anonymous Token
153(2)
5.3.2 Two-Way Onion Routing to Support Anonymous Usage of Cloud Software
155(3)
5.3.3 Efficiency Optimisation: Two-Way Onion Routing with Compact Diffie-Hellman Handshakes
158(4)
5.3.4 Security Analysis
162(3)
6 Practical Systems to Achieve Anonymity: How to Use Them 165(18)
6.1 Installation and Usage of Tor
166(3)
6.1.1 Download and Installation
166(2)
6.1.2 Configuration
168(1)
6.2 Installation and Usage of I2P
169(5)
6.2.1 Download and Installation
169(4)
6.2.2 Configuration
173(1)
6.3 Installation and Usage of JAP/JonDo
174(4)
6.3.1 Download and Installation
175(1)
6.3.2 Configuration
176(2)
6.4 Installation and Usage of QuickSilver
178(5)
6.4.1 Download and Installation
178(2)
6.4.2 Configuration
180(3)
References 183(8)
Index 191
Dr. Kun Peng received his bachelors degree in software and masters 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.