Abstract
SummaryWith the wide deployment of cloud computing, outsourcing complicated computational tasks to cloud service providers has attracted much attention. An increasing number of clients with computationally constrained devices choose to outsource their heavy tasks to cloud servers to reduce the computational overhead in local. However, how to preserve the integrity of computational results becomes a challenge since commercial cloud servers are not trusted. Public verifiability is an effective mechanism to allow clients to verify the integrity of the results returned by the servers. Because the results are sensitive in many applications, it raises the problem of privacy leakage in the public verification process. In this paper, we propose an efficient verifiable computation scheme while keeping output privacy. The proposed scheme achieves blind verifiability such that the verifiers who have not the additional information (retrieve key) can verify the integrity of the result without learning the result. Furthermore, by combining with (k,n)‐threshold sharing, our scheme allows the clients jointly learn the results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Concurrency and Computation: Practice and Experience
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.