IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v18y2026i6p302-d1959126.html

Secure Federated Learning Algorithms for Vertical and Combined Data Partitioning

Author

Listed:
  • Amir Anees

    (South West Sydney Local Health District and Ingham Institute, South Western Sydney Clinical Campus, School of Clinical Medicine, UNSW, Sydney 2033, Australia)

  • Ding Ming

    (Data61, CSIRO, Eveleigh 2015, Australia)

  • Gnana Bharathy

    (Australian Research Data Commons, University of Technology Sydney, Ultimo 2007, Australia)

  • Lois Holloway

    (South Western Sydney Clinical Campus, School of Clinical Medicine, UNSW, Sydney 2033, Australia)

Abstract

With the growing need for collaborative machine learning across institutions holding sensitive data, ensuring data privacy without compromising model performance has become an important challenge. This work introduces secure federated learning algorithms that use encryption and masking techniques to protect the privacy of data during collaborative model training. Three federated learning algorithms were developed: one for vertical federated learning and two combining horizontal and vertical data partitioning. The proposed algorithms are designed such that participating clients communicate only with the server, even when data exchange between clients is required. This exchange occurs through the server with the help of encryption and masking. The performance of the algorithms, evaluated in terms of accuracy and loss, shows competitive results. The accuracy remains unchanged compared to the centralised scenario for the vertical federated learning algorithm and one of the combined federated learning algorithms, and it remains highly competitive with the other combined federated learning algorithm. The privacy analyses conducted as part of this work demonstrate no risk of data leakage ensuring that no party involved can infer sensitive information.

Suggested Citation

  • Amir Anees & Ding Ming & Gnana Bharathy & Lois Holloway, 2026. "Secure Federated Learning Algorithms for Vertical and Combined Data Partitioning," Future Internet, MDPI, vol. 18(6), pages 1-28, June.
  • Handle: RePEc:gam:jftint:v:18:y:2026:i:6:p:302-:d:1959126
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/18/6/302/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/18/6/302/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:18:y:2026:i:6:p:302-:d:1959126. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.