Skip to main content
Springer Nature Link
Log in

SEVCOD: secure and efficient verifiable computation on outsourced data

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Cloud computing has gained significant popularity, as a promising service platform in recent years. It facilitates the users to offload their resource-intensive computations to cloud server (CS) for efficient processing. Meanwhile, users prioritize the security and privacy of their sensitive data by encrypting it before outsourcing it to the CS. However, performing computations like multivariate polynomial function over encrypted data and verifying their correctness poses a major challenge. Homomorphic Encryption (HE) has been proposed as a solution to enable computations over encrypted data while maintaining data confidentiality. This work proposes a secure and efficient scheme for verifiable computation on outsourced data, named SEVCOD. SEVCOD combines the power of multivariate polynomial factorization and homomorphic encryption to enable public verification of CS’s computation results preserving confidentiality of both data and result. The effectiveness of our scheme is validated through security proofs and performance analysis. The result analysis demonstrates that, SEVCOD significantly reduces computational burden for verifiers and enhances the overall efficiency of the outsourced computation process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Availability of data and materials

Not applicable.

Code availability

Not applicable.

References

  1. Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: ACM SIGSAC Conference on Computer & Communications Security, pp. 863–874 (2013)

  2. Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. Public-Key Cryptogr PKC 2021, 528–558 (2021)

    MathSciNet  Google Scholar 

  3. Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS ’12, pp. 309–325, New York, NY, USA. Association for Computing Machinery (2012)

  4. Chen, X., Li, J., Weng, J., Ma, J., Lou, W.: Verifiable computation over large database with incremental updates. IEEE Trans. Comput. 65(10), 3184–3195 (2016)

    Article  MathSciNet  Google Scholar 

  5. Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on encrypted data. In: Public-Key Cryptography—PKC 2020, pp. 124–154. Springer, Cham (2020)

  6. Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. Cryptology ePrint Archive, Paper 2021/322, 2021. https://eprint.iacr.org/2021/322

  7. Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Advances in Cryptology—CRYPTO 2010, pp. 465–482. Springer (2010)

  8. Gong, X., Hu, B., Xiong, Y., Zhao, X.: Practical verifiable computation on encrypted data. In: 2022 IEEE 8th Intl Conference on Big Data Security on Cloud (BigDataSecurity), pp. 67–74 (2022)

  9. Gopalan, P., Khot, S., Saket, R.: Hardness of reconstructing multivariate polynomials over finite fields. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07), pp. 349–359 (2007)

  10. Nayak, S.K., Tripathy, S.: SEMKC: secure and efficient computation over outsourced data encrypted under multiple keys. IEEE Trans. Emerg. Top. Comput. 9(1), 414–428 (2021)

    Article  Google Scholar 

  11. Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238–252 (2013)

  12. Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Theory of Cryptography, pp. 422–439. Springer (2012)

  13. Rivest, R.L., Dertouzos, M.L.: On Data Banks and Privacy Homomorphisms, pp. 169–179. Foundations of Secure Computation, Academia Press (1978)

    Google Scholar 

  14. Setty, S., Mcpherson, R., Blumberg, A., Walfish, M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS Symposium, vol. 2012, pp. 1–20 (2012)

  15. Setty, S., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J., Walfish, M.: Taking proof-based verified computation a few steps closer to practicality. In: 21st USENIX Security Symposium, pp. 253–268 (2012)

  16. Shan, Z., Ren, K., Blanton, M., Wang, C.: Practical secure computation outsourcing: a survey. ACM Comput. Surv. 51(2) (2018)

  17. Thaler, J.R.: Practical verified computation with streaming interactive proofs. PhD thesis, The Department of School of Engineering and Applied Sciences, Harvard University, Cambridge, USA (2013)

  18. van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) Advances in Cryptology—EUROCRYPT 2010, pp. 24–43. Springer (2010)

  19. Viand, A., Knabenhans, C., Hithnawi, A.: Verifiable fully homomorphic encryption (2023)

  20. Yan, Z., Xixun, Yu., Ding, W.: Context-aware verifiable cloud computing. IEEE Access 5, 2211–2227 (2017)

    Article  Google Scholar 

  21. Yang, Y., Huang, X., Liu, X., Cheng, H., Weng, J., Luo, X., Chang, V.: A comprehensive survey on secure outsourced computation and its applications. IEEE Access 7, 159426–159465 (2019)

    Article  Google Scholar 

  22. Xixun, Yu., Yan, Z., Vasilakos, A.V.: A survey of verifiable computation. Mob. Netw. Appl. 22(3), 438–453 (2017)

    Article  Google Scholar 

  23. Xixun, Yu., Yan, Z., Zhang, R.: Verifiable outsourced computation over encrypted data. Inf. Sci. 479, 372–385 (2019)

    Article  Google Scholar 

Download references

Funding

Not applicable.

Author information

Authors and Affiliations

  1. Indian Institute of Technology Patna, Bihta, Patna, Bihar, 801106, India

    Partha Sarathi Chakraborty, Omkar Santosh Gavhane & Somanath Tripathy

Authors
  1. Partha Sarathi Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omkar Santosh Gavhane
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Somanath Tripathy
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

PSC: Conceptualization, Investigation, Methodology, Experiments, Writing. OSG: Conceptualization, Investigation, Methodology, Experiments. ST: Conceptualization, Investigation, Methodology, Review.

Corresponding author

Correspondence to Somanath Tripathy.

Ethics declarations

Competing interest

Not applicable.

Ethics approval

Not applicable.

Consent to participate

Not applicable.

Consent for publication

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chakraborty, P.S., Gavhane, O.S. & Tripathy, S. SEVCOD: secure and efficient verifiable computation on outsourced data. Cluster Comput 27, 4725–4739 (2024). https://doi.org/10.1007/s10586-023-04190-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-023-04190-9

Keywords

Search

Navigation