Describe a simple scheme that allows peers to verify blocks

Assignment Help Computer Engineering

Reference no: EM132110240

In the BitTorrent P2Pfile distribution protoco, 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.

Reference no: EM132110240

Questions Cloud

Create a mips asm program that requests for three numbers : Create a MIPS asm program that requests for three numbers from the user. Month, Day, and Year. You may assume that a valid date is given.

Write an arm assembly program to implement a time-of-day : Write an ARM assembly program to implement a Time-Of-Day clock application as specified.

Read about and implement radix sort : After you programmed the Radix Sort and tested it, run the algorithm by hand on the following list: [1,6,3,4,8,2,5,7]. Show all the steps.

Is array that is in sorted order a min-heap : What are the minimum and maximum number of elements in a heap of height h? Is array that is in sorted order a min-heap?

Describe a simple scheme that allows peers to verify blocks : Assume that when a peer joins a torrent, it initially gets a .torrent file from a fully trusted source.

Advise billy about his legal rights : LAW2457 - LAW OF INVESTMENTS AND FINANCIAL MARKETS - Advise Billy about his legal rights. Refer to relevant statute law and case law to support your response

Prove the inference rules for functional dependencies : A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules.

Prove or disprove the following proposed inference rules : A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules.

Prove the following statement using hals theorem : Prove the following statement using Hall's Theorem. For any bipartite graph G=(U, V, E), if every node (either a left node or a right node) has exactly.

User Account

All Pages