Verifiable Outsourced Computation with Full Delegation
With the development of cloud computing, verifiable computation (VC) has attracted considerable attentions due to its importance. However, the existing VC schemes suffer from two substantial shortcomings that limit their usefulness: (i) they have to invest expensive computational tasks in the preprocessing stage, which has exceeded the available computation capacity of the client, and (ii) they do not support frequent updates, so that each update needs to perform the computation from scratch. To resolve these problems, we propose a novel primitive called verifiable outsourced computation with full delegation (FD-VC), which greatly reduces the computation cost of the client by delegating the preprocessing to the cloud. During this phase, the cloud cannot obtain any knowledge of the verification key. To the best of our knowledge, it is the first VC scheme not only supporting full delegation but also supporting dynamic update. The highlight of our scheme is that verification and update cost are constant and independent of the degree of the polynomial. Our scheme is provably correct and secure based on bilinear pairing and the hardness assumption of Bilinear Diffie-Hellman Exponent problem, and our analyses show that our scheme is very practical and suitable for the real world applications.
KeywordsVerifiable computing Full delegation Dynamic update Bilinear pairing
We thank the anonymous reviewers and Bao Li for their fruitful suggestions. This work was supported by the Natural Science Foundation of China under Grant Nos. 61772127, 61703088 and 61472184, the National Science and Technology Major Project under Grant No. 2013ZX03002006, the Liaoning Province Science and Technology Projects under Grant No. 2013217004, the Fundamental Research Funds for the Central Universities under Grant No. N151704002.
- 2.BBC-NEW: The interview: a guide to the cyber attack on Hollywood. http://www.bbc.co.uk/news/entertainment-arts-30512032
- 3.Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. Cryptology ePrint Archive, Report 2009/547 (2009). http://eprint.iacr.org/
- 5.Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 723-732 (1992)Google Scholar
- 7.Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for Muggles. In: Proceedings of the ACM Symposium on the Theory of Computing (2008)Google Scholar
- 9.Parno, B., Gentry, C., Howell, J., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: Proceedings of the 34th IEEE Symposium on Security and Privacy, S&P 2013, pp. 238–252 (2013)Google Scholar
- 10.Costello, C., et al.: Geppetto: versatile verifiable computation. In: Proceedings of the 36th IEEE Symposium on Security and Privacy, S&P 2015, pp. 253–270 (2015)Google Scholar
- 12.Fiore, D., Gennaro, R.: Publicly verifiable delegation of large polynomials and matrix computations, with applications. ePrint 2012/281 (2012)Google Scholar
- 15.Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 21st ACM Conference on Computer and Communications Security, Scottsdale, AZ, USA, pp. 844–855 (2014)Google Scholar