This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Input Verifiability in Delegation of Computation with Embedded Proofs
Authors
Tanvi Sharma, Rohit Singh
Abstract
Emerging paradigm of pay-per-use through cloud computing has led to outsourcing of many business-critical functions to cloud service providers. Delegation of Computation is useful concept, only until the results of computation can be verified. Such verifiability has been achieved through interactive proof systems, leading to high communication cost. Other methods involve cryptographic primitives which impose high computation cost, rendering it unsuitable for mobile clients. We propose here a protocol with reduced communication cost for light-weight devices, utilizing cryptographic primitives to generate proofs. The proof-generating function is incorporated into the delegated function to make it fool-proof.
Keywords- verifiable delegation of computation, interactive proofs
Publication Details
Unique Identification Number - IJEDR1403081Page Number(s) - 3313-3318Pubished in - Volume 2 | Issue 3 | Sept 2014DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Tanvi Sharma, Rohit Singh, "Input Verifiability in Delegation of Computation with Embedded Proofs", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.2, Issue 3, pp.3313-3318, Sept 2014, Available at :http://www.ijedr.org/papers/IJEDR1403081.pdf
Article Preview
|
|
||||||
|
|
||||||||
