Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/120573
Title: EFFICIENT DELEGATION ALGORITHMS FOR OUTSOURCING COMPUTATIONS ON MASSIVE DATA STREAMS
Authors: VED PRAKASH
Keywords: data streams, communication complexity, Merlin-Arthur classes, interactive proofs, annotation,
Issue Date: 16-Mar-2015
Source: VED PRAKASH (2015-03-16). EFFICIENT DELEGATION ALGORITHMS FOR OUTSOURCING COMPUTATIONS ON MASSIVE DATA STREAMS. ScholarBank@NUS Repository.
Abstract: This thesis closely examines algorithms for verifying computations on massive data streams motivated by the surging popularity of cloud computing. The cloud not only stores the massive data set, but executes computations on it and communicates the results to the client. Although the promise of third-party computation is enormous, many things can possibly go wrong. Errors could occur due to a buggy algorithm or the third party could have been externally compromised. The main central question we wish to address in this thesis is how can we trust the results provided by the third-party. We design and analyze algorithms to achieve this in different streaming models, depending on the type of interaction between the client and the third party. We also introduce a new streaming model which differs from the previously known models and study its power and limitations.
URI: http://scholarbank.nus.edu.sg/handle/10635/120573
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
PrakashV.pdf2.17 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

116
checked on Apr 19, 2018

Download(s)

60
checked on Apr 19, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.