Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Anonymous networks: A theoretical and practical approach
Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science. Linköping University, Faculty of Science & Engineering.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10,5 credits / 16 HE creditsStudent thesis
Abstract [en]

This thesis presents an overview of different solutions for anonymous networks. Theory behind connection- and data-anonymity is described, how to implement them and the theory behind commonly used cryptography. The theory behind one anonymous network is also put into practice as we demonstrate a proof-of-concept implementation of a mix-net online voting service, where RSA and AES is used for encryption. A comparison between time taken for sending different amount of encrypted votes versus non-encrypted votes, sending the votes through different number of mix-servers and varying their file sizes was made. It was observed that there was a linear increase in time taken for both encrypted and non-encrypted votes when the amount of votes being processed by the system increased from 1 to 200. This linear behaviour was also observable when the amount of intermediate mix-servers increased from 1 to 6, and file sizes from 0.9 to 7.2 Mb. The difference between encrypted and non-encrypted data increased rapidly when more simultaneously votes were sent, more mixes were used and larger files were encrypted. For example, the system processes an encrypted vote with one mix around four times as long as an unencrypted, and when sending 200 votes with six mixes it takes almost 30 times as long. When increasing our system's intermediate mixes by two we attain an increase in processing time of 9.7% per encrypted message. This processing time is also 4.4 times as long per Mb for encrypted messages than for non-encrypted.

Place, publisher, year, edition, pages
2016. , p. 27
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-134024ISRN: LIU-IDA/LITH-EX-G--16/078—SEOAI: oai:DiVA.org:liu-134024DiVA: diva2:1066541
Subject / course
Computer science
Supervisors
Examiners
Available from: 2017-02-07 Created: 2017-01-18 Last updated: 2017-02-07Bibliographically approved

Open Access in DiVA

fulltext(922 kB)45 downloads
File information
File name FULLTEXT01.pdfFile size 922 kBChecksum SHA-512
dd5b484e14d44721e2f435c42bd59d6d212c697fbcf86ccea5f837f7a33b00e3dbf21a0997b6e0299436606016b168e751d6f81c2f63213a0de394efcae1728e
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Gudjonsson, Karl FredrikUlander, Alexander
By organisation
Department of Computer and Information ScienceFaculty of Science & Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 45 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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