An Efficient Privacy-preserving Approach for Secure Verifiable Outsourced Computing on Untrusted Platforms

An Efficient Privacy-preserving Approach for Secure Verifiable Outsourced Computing on Untrusted Platforms

Oladayo Olufemi Olakanmi, Adedamola Dada
Copyright: © 2019 |Pages: 20
DOI: 10.4018/IJCAC.2019040105
OnDemand:
(Individual Articles)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In outsourcing computation models, weak devices (clients) increasingly rely on remote servers (workers) for data storage and computations. However, most of these servers are hackable or untrustworthy, which makes their computation questionable. Therefore, there is need for clients to validate the correctness of the results of their outsourced computations and ensure that servers learn nothing about their clients other than the outputs of their computation. In this work, an efficient privacy preservation validation approach is developed which allows clients to store and outsource their computations to servers in a semi-honest model such that servers' computational results could be validated by clients without re-computing the computation. This article employs a morphism approach for the client to efficiently perform the proof of correctness of its outsourced computation without re-computing the whole computation. A traceable pseudonym is employed by clients to enforce anonymity.
Article Preview
Top

The wide variety of small computationally weak devices and the growing number of computationally intensive tasks makes the delegation of computation to large data centers a desirable solution. Much research had been done on outsourcing computation, few of them delve into how computation can be outsourced to honest workers while other proposed different ways to verify outsourced computation results from semi-honest workers. However, in some of these outsourcing and verification schemes, users lose direct access to the computational tasks, and may experience possible threats like data privacy and invalidity of results.

For example, Anmin et al. (2018) proposed two efficient algorithms for outsourcing multiple and single composite modular exponentiations. Their proposed scheme remarkably improved checkability by allowing user to discover any misbehavior and inconsistency. The scheme has a subroutine to realize identity-based signatures and identity-based multi-signatures schemes. However, their scheme only checks the integrity of the result not the correctness of the result. Xing and Chunming (2014) proposed a protocol for outsourcing characterization of polynomials and computation of Eigen values of a matrix. The protocol engaged disguise approach for the construction of efficient, verifiable outsource computation scheme without much cryptography assumption. Their scheme is application centric. Also, Kai et al. (2017) proposed a scalable verifiable outsourcing computation protocol for marine cloud computing to combat the problem of low storage and computation associated with the ocean-going vessels. Their protocol allows users who have verification tokens to verify the correctness of the computational results returned by the cloud. They engaged a non-interactive method for the proof of correctness using an oracle random model.

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing