EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 2, Problem P26P
a)
Program Plan Intro
Given Information:
Bob joins a BitTorrent torrent. Bob does not want to upload any data to other peers which is called free riding.
Bob claims that he can receive a complete copy of the file that is shared by the swarm.
b)
Program Plan Intro
Given Information:
Bob joins a BitTorrent torrent. Bob does not want to upload any data to other peers which is called free riding.
Bob claims that he can further make his “free-riding” more efficient by using a collection of multiple computers with distinct IP addresses in the computer lab in his department.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Https is a protocol used to secure websites from being tampered with by other parties without proper authorization. it bridges the gap between sender and receiver.Using protocols like secure socket layer/TLS, HTTPS encrypts data sent over the internet, making it unreadable to anybody who shouldn't have it.This prevents a "man in the middle" assault on the system.Such assaults intercept messages before they reach their intended recipient.It then transmits the revised information to the user.It guarantees the server's authenticity, too.
Construct an experiment to estimate the speed at which a particular computer can process an authentication password. From that estimate, determine how long it would take to test common password candidate lists, such as a list of 100 or 1000 popular passwords, the same list enhanced with orthographic substitutions (3 for e, zero for O, one for l, 2 for z, and so forth), and a word list from a common online dictionary.
In the BitTorrent P2P file distribution protocol, the seed breaks the file into blocks, and the peers redistribute the blocks to each other. Without any protection, an attacker can easily wreak havoc in a torrent by masquerading as a benevolent peer and sending bogus blocks to a small subset of peers in the torrent. These unsuspecting peers then redistribute the bogus blocks to other peers, which in turn redistribute the bogus blocks to even more peers. Thus, it is critical for BitTorrent to have a mechanism that allows a peer to verify the integrity of a block, so that it doesn’t redistribute bogus blocks. Assume that when a peer joins a torrent, it initially gets a .torrent file from a fully trusted source. Describe a simple scheme that allows peers to verify the integrity of blocks.
Chapter 2 Solutions
EBK COMPUTER NETWORKING
Ch. 2 - List five nonproprietary Internet applications and...Ch. 2 - Prob. R2RQCh. 2 - Prob. R3RQCh. 2 - Prob. R4RQCh. 2 - Prob. R5RQCh. 2 - Prob. R6RQCh. 2 - Prob. R7RQCh. 2 - Prob. R8RQCh. 2 - Prob. R9RQCh. 2 - Prob. R10RQ
Ch. 2 - Why do HTTP, SMTP, and POP3 run on top of TCP...Ch. 2 - Prob. R12RQCh. 2 - Prob. R13RQCh. 2 - Prob. R14RQCh. 2 - Prob. R15RQCh. 2 - Prob. R16RQCh. 2 - Prob. R17RQCh. 2 - From a users perspective, what is the difference...Ch. 2 - Prob. R19RQCh. 2 - Prob. R20RQCh. 2 - Prob. R21RQCh. 2 - Prob. R22RQCh. 2 - Prob. R23RQCh. 2 - Prob. R24RQCh. 2 - Prob. R25RQCh. 2 - In Section 2.7, the UDP server described needed...Ch. 2 - Prob. R27RQCh. 2 - Prob. P1PCh. 2 - Prob. P2PCh. 2 - Prob. P3PCh. 2 - Prob. P4PCh. 2 - Prob. P5PCh. 2 - Prob. P6PCh. 2 - Prob. P7PCh. 2 - Prob. P8PCh. 2 - Prob. P9PCh. 2 - Prob. P10PCh. 2 - Prob. P11PCh. 2 - Prob. P13PCh. 2 - Prob. P14PCh. 2 - Prob. P15PCh. 2 - Prob. P16PCh. 2 - Prob. P17PCh. 2 - Suppose you can access the caches in the local DNS...Ch. 2 - Prob. P21PCh. 2 - Prob. P22PCh. 2 - Prob. P23PCh. 2 - Prob. P25PCh. 2 - Prob. P26PCh. 2 - Prob. P27PCh. 2 - Prob. P28PCh. 2 - Prob. P29PCh. 2 - Prob. P30PCh. 2 - Prob. P31PCh. 2 - Prob. P32P
Knowledge Booster
Similar questions
- What is the effect of including spelling errors, vs. automatically correcting spelling errors on Heaps’ law?Compute the vocabulary size M for this scenario: Looking at a collection of web pages, you find that there are 3000 different terms in the first 10,000 tokens and 30,000 different terms in the first 1,000,000 tokens. Assume a search engine indexes a total of 20,000,000,000 (2 × 1010) pages, containing 200 tokens on average What is the size of the vocabulary of the indexed collection as predicted by Heaps’ law?arrow_forwardOne of the problems with the Internet email system is that sending forged emails is relatively straightforward, i.e., it is easy to send an email with a fake sender/from address. One solution to this problem would be for a domain’s mail servers to digitally sign any email originating from the domain. For this to be useful, the public key would need to be made available to clients to validate the signatures. It is proposed that the public keys of the mail servers will be verified and signed by a certification authority (same as SSL/TLS certificates) and distributed via a standardised URL for the domain, e.g., https://mybusiness.com/email.pubkey. (a) Explain how the client would obtain the public key and validate the email server’s digital signatures. (b) Discuss the problem of trusting the obtained public key and how this solution results in public keys that can/cannot be trusted. (c) Indicate whether you believe this approach could be used to prevent forged emails and explain why it…arrow_forwardAlice sets up an RSA public/private key, but instead of using two primes, she chooses three primes p, q, and r and she uses n=pqr as her RSA-style modulus. She chooses an encryption exponent e and calculates a decryption exponent d. Encryption and Decryption are defined: C ≡ me mod n and m ≡ Cd mod n where C is the ciphertext corresponding to the message m. Decryption: de ≡ 1 mod φ(n) | Let p = 5, q = 7, r = 3, e = 11, and the decryption exponent d = -13. n = 105 & φ(n) = 48 Q: Alice upgrades to three primes that are each 200 digits long. How many digits does n have?arrow_forward
- Suppose we have an alphabet of 30 characters, labelled as the integers modulo 30. Suppose that a 2 × 2 affine shift cipher is used to encode a message and it is known that the translation vector B is (0,0). The cipher text comes along as "21, 2, 13, 3, 14, 7, 0, 15,..." and you figure out through some other means that the plaintext starts "15, 16, 1, 1, plaintext? ." What is the encryption key? What are the next four digits of the ....arrow_forwardThe token bucket algorithm is a popular method for traffic shaping (recapthe algorithm in textbook Ch. 5.3.2). A computer uses a token bucket with a capacity of 400megabytes (MB), and a rate of 10 MB per second. The machine starts generating 20 MB persecond continuously when the bucket contains 200 MB. How long will it take to send 1000 MB?arrow_forwardProblem 3. Two texts were encrypted with a Vigenère cipher, both using the same key. The ciphertexts are We found out that the first message begins with HELLOBOB, and ends with ALICE, but we don't know what is in between. ALLYY TUJRM ZKXAT BXAMP OIGKE LVRXS ZBCMH YNHLC VSIMV TVIX AHVRK FOKZJ EKTR Decrypt the second message.arrow_forward
- Over a network using WEP, we were able to capture two frames with the sameInitialization Vector (IV). The following are the encrypted messages:• First frame encrypted message:1 0 0 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 1 0 1 1 0 0 1 0 1 1 1 1 0 1 1 0 1 1 0 1 0 0 11 1 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 0• Second frame encrypted message:1 1 0 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 0 1 1 1 1 0 11 0 1 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 1 0We also know that one of the messages is a control message with the following plaintext content:0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 01 0 0 1 1 0 0 1 0 0 0 1 1 1 0 0 01. Find the plaintext of the other message.2. If the captured messages were from two different stations on a network that usesTKIP, is it possible to find the plaintext of the other message? Explain why orwhy not possible.arrow_forwardIn cryptography, the Caesar cipher is a type of scroll cipher and is one of the simplest and best-known ciphers. When encrypting a message in the Caesar cipher, each letter is usually replaced by the letter three letters in the alphabet. Let the alphabetic scrollback look like this: aw w ww ww m ww w ww w vwwwwwww www ww wwm w w wwwm www ww defg hijkI mnop 9rstuvwxy z abc a bcd efghilj kI P9rstu v w xy z m Keep the encryption in the Python dictionary structure. www ww Write a Python program that takes the three-letter message as input and prints the encrypted message. Guidance: An empty string can be inserted one by one by replacing the letters of the input. wwwwwwwwwww www wn ww wn ww w www wwh m Entry: Message: kar Encrypted message: hxo Entry: Message: yel Encrypted message: vbi Entry: Message: ses Encrypted message: pbp Entry: Message: mtk Encrypted message: jqharrow_forwardA summary of RSA algorithm is described on W10 Notes. Assume that the algorithm is used with p= 11,q=3 and e = 3. 1. Compute n, d, and the decryption key, d 2. Suppose that we wanted to use this system to send a message secretly by letting A = 2, B3,C4,...,Z 27, a - 28, b= 29,... and interleave/scramble the words in the message for extra added security purposes. Compute the plaintext message if the received ciphertext is BQRRCDIHICHMarrow_forward
- A shortcoming of using an elliptic curve E(Fp) for cryptography is the fact that it takes two coordinates to specify a point in E(Fp). However, as discussed briefly at the end of Sect. 6.4.2, the second coordinate actually conveys very little additional information.(b) Alice and Bob decide to use the prime p = 1123 and the elliptic curveE : Y2 = X3 + 54X + 87.Bob sends Alice the x-coordinate x = 278 and the bit β = 0. What point is Bob trying to convey to Alice? What about if instead Bob had sent β = 1?arrow_forwardThe Caesar Cipher Algorithm was introduced in Week #1. Encryption is the act of encoding a message with the intent of allowing only authorized people the knowledge of how to read that message. An encrypted message can be decoded, allowing the secured content to be read after decryption. Recall that the Caesar Cipher uses alphabets as the primary source of information but shifted a certain number of letters to the left or right as a key to create the encrypted data. The Caesar Cipher is easily hacked because of the simple technique used to build the key that encrypts and decrypts the data. In this lab, the key is the number of alphabets shifted, and the direction is always toward the increasing alphabetical order. This provides 26 ways of encrypting a message and therefore makes it easier to be hacked by guessing the key within the range of 0 - 25. Write the function caesar_hack( ) that takes three parameters: a Caesar Cipher encrypted message, an alphabet list, and the original…arrow_forwardThe Caesar Cipher Algorithm was introduced in Week #1. Encryption is the act of encoding a message with the intent of allowing only authorized people the knowledge of how to read that message. An encrypted message can be decoded, allowing the secured content to be read after decryption. Recall that the Caesar Cipher uses alphabets as the primary source of information but shifted a certain number of letters to the left or right as a key to create the encrypted data. The Caesar Cipher is easily hacked because of the simple technique used to build the key that encrypts and decrypts the data. In this lab, the key is the number of alphabets shifted, and the direction is always toward the increasing alphabetical order. This provides 26 ways of encrypting a message and therefore makes it easier to be hacked by guessing the key within the range of 0 - 25. Write the function caesar_hack( ) that takes three parameters: a Caesar Cipher encrypted message, an alphabet list, and the original…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education