Input Verifiability in Delegation of Computation with Embedded Proofs
verifiable delegation of computation, interactive proofs
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.
Tanvi Sharma, Rohit Singh. "Input Verifiability in Delegation of Computation with Embedded Proofs".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.2, Issue 3, pp.3313-3318, URL :https://rjwave.org/ijedr/papers/IJEDR1403081.pdf
Volume 2 Issue 3
Pages. 3313-3318
