Skip to content
Open access

Efficient Verifiable Computation for Support Vector Machine Training over Secret-Shared Data

Jul 2026 · Cryptography · Vol 10, pp. 46 · 0 citations · 34 references

TL;DR

A lightweight, privacy-preserving, and verifiable SVM training scheme designed for resource-constrained clients, which maintains stable classification performance while achieving an order-of-magnitude decrease in training runtime compared with existing ciphertext-based methods.

Abstract

The outsourcing of machine learning tasks, such as Support Vector Machine (SVM) training, to cloud platforms poses significant security challenges, primarily concerning the confidentiality of sensitive training data and the integrity of computation results returned by potentially malicious servers. To address these challenges, this paper proposes a lightweight, privacy-preserving, and verifiable SVM training scheme designed for resource-constrained clients. Our scheme leverages a replicated secret sharing protocol to securely distribute training data and model parameters across multiple non-colluding servers, executing the entire collaborative training process in the share domain without leaking plaintext information. Furthermore, to guarantee computational correctness, we introduce a novel interval-based index point storage strategy combined with a bilinear mapping-based parameter label consistency check. This verifiable mechanism enables clients to perform sampled, lightweight audits of the cloud’s intermediate training states and final outputs. Experimental evaluations on multiple typical datasets demonstrate that the proposed scheme maintains stable classification performance while achieving an order-of-magnitude decrease in training runtime compared with existing ciphertext-based methods, offering a highly configurable trade-off among verification coverage, computational overhead, and storage cost.

Read PDF

Similar papers

Open access Aug 2026

Practical Verifiable Multi-Key Searchable Encryption with Optimal Overhead

A novel VMKSE scheme (VMKSE-BFF) is presented by adopting BFF, which can simultaneously support verifiability of and secure data sharing in a multi-user setting and a comparison with the existing VMKSE schemes is provided.

Yandong Su, Bing-Hang Wang, Yan-Jie Xiang et al. · 0 citations
Preprint Jul 2026

PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning

This work proposes PRoVeFL-a novel, modular FL framework that is Privacy-preserving, Byzantine-Robust, and ensures Verifiable aggregation, and improves runtime over the prior works, Prio and ELSA, based on distributed trust with comparable security guarantees, up to 100x and 10x, respectively.

Harsh Kasyap, Anil Kumar Pradhan, U. Atmaca et al. · 0 citations
Conference Jul 2026

An Efficiently Traceable Secure Data Sharing Scheme with Intelligence for Cloud Computing

The growing demand for large models in industrial Internet necessitates secure sharing of cloud-stored training data. However, existing Ciphertext-Policy Attribute-Based Encryption schemes suffer from low efficiency and insufficient accuracy in tracing key-leaking users. We propose a traceable secure data sharing schem...

Shaojian Zhang, Jun Ye · 0 citations
2026

On the Attribute Hiding Security of Privacy Preserving Secret-Sharing-Based Outsourced Decision Tree Classification

Decision tree classification serves as a fundamental component in many machine learning applications. As inference services are increasingly outsourced to cloud platforms, designing privacy-preserving mechanisms has become important. To secure outsourced decision tree inference, Chen et al. proposed SecDT, an efficient...

Chang-Ching Hung, Tsung-Che Hsieh, Yu-Chi Chen et al. · 0 citations
Open access Aug 2026

Paras: Actively Secure Two-Server Private Histograms

Paras, the first two-server protocol for private histogram computation that achieves robustness against collusion between a malicious server and arbitrarily many malicious clients is presented, and is shown to be highly efficient and scalable.

Dimitris Mouris, Lucas Piske, Pratik Sarkar et al. · 0 citations
Review Open access Aug 2026

A Survey on Privacy-Preserving Techniques for Cloud Data Processing Using Homomorphic Encryption and Federated Learning

This paper presents a structured review of privacy-preserving data processing techniques for cloud environments built on HE and FL, individually and in hybrid combination, and identifies promising directions for future research.

Shivendra Shukla, C. S. Gautam, Divyansh Tiwari · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.