Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Proof of Work – En studie av proof-of-work som skydd mot överbelastningsattacker.
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2011 (Swedish)Independent thesis Advanced level (professional degree), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

The purpose of this essay is to explain the proof of work protocol and to evaluate its ability to protect a network resource from denial of service attacks. By implementing a proof of work protocol we aim to evaluate what kind of puzzles give an even workload to clients. The results prove that proof of work can be used to protect a network re- source by limiting the amount of calls a client can perform in a certain time. It is also evident that when subpuzzles are used there is less variation of how long it takes to solve a puzzle, therefore subpuzzles are to be prefered over imple- mentations without subpuzzles. Even though variations in calculation times are reduced, clients with low performance hardware will still have a disadvantage in relation to clients with more powerful hardware.

Abstract [sv]

Denna uppsats ämnar förklara protokollet proof-of-work samt utvärdera dess förmåga att skydda en nätverksresurs från att göras otillgänglig av en överbelastningsattack. Vi vill genom tester på en implementation av protokollet svara på vilken form av pussel som ger en rättvis arbetsfördel- ning för klienterna. Resultatet visar att proof-of-work kan skydda en nätverksresurs genom att begränsa antalet an- rop som varje klient kan göra per tidsenhet. Vi ser även att en implementation med delpussel ger en mindre variation i beräkningstider och är därför att föredra framför en svårare implementation utan delpussel. Klienter med mindre kraft- fulla datorer missgynnas dock fortfarande i förhållande till klienter med kraftfullare maskinvara.

Place, publisher, year, edition, pages
2011.
Series
Kandidatexjobb CSC, K11082
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-130828OAI: oai:DiVA.org:kth-130828DiVA: diva2:654275
Educational program
Master of Science in Engineering - Computer Science and Technology
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-10-07 Created: 2013-10-07

Open Access in DiVA

No full text

Other links

http://www.csc.kth.se/utbildning/kandidatexjobb/datateknik/2011/rapport/henriques_fredrik_OCH_nordmark_niklas_K11082.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf