search query: @keyword FUSE / total: 6
reference: 4 / 6
« previous | next »
Author:Björkqvist, Mathias
Title:Integrity protection of untrusted storage
Dataintegritetssdkydd för otillförlitligt lagringsutrymme
Publication type:Master's thesis
Publication year:2007
Pages:(9) + 54      Language:   eng
Department/School:Tietotekniikan osasto
Main subject:Informaatiotekniikka   (T-115)
Supervisor:Simula, Olli ; Molva, Refik
Instructor:Cachin, Christian
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto  8683   | Archive
Keywords:integrity
hashing
incremental hashing
dynamic accumulator
FUSE
Java
integritet
hashing
inkremental hashing
dynamisk ackumululator
Abstract (eng):Storing information such as data backups or family pictures on third party servers instead of local storage can be conceived as getting increasingly commonplace as more and more providers are starting to offer these services.
In this situation, a user may not fully trust the external storage space and may want to verify the integrity of the stored data when it is retrieved, using a small authentication value on local trusted storage.

Several cryptographic integrity protection schemes exist for computing the authentication value, the most commonly used being Merkle hash trees.
These hash trees incur logarithmic work (in the total number of blocks) for updating and for verifying a block, and a linear amount of additional untrusted storage space.
There are also alternative methods such as incremental hashing and dynamic accumulators, where the work required for one operation is constant (updating for incremental hashing, verifying for accumulators), whereas the other operation incurs linear overhead.

This project consisted of implementing an integrity checker using incremental hashing and dynamic accumulators, and evaluating the performance of both schemes.
The integrity checker was also integrated into an integrity protected file system using the open source project FUSE for implementing file systems in userspace under Linux.
The implementation language was Java, and the FUSE integration was done using the FUSE-J Java bindings.

This Master's Thesis has been done for IBM Zürich Research Laboratory, Switzerland.
ED:2007-11-16
INSSI record number: 34871
+ add basket
« previous | next »
INSSI