Limited-Sharing Multi-Party Computation With Reduced Recovery Threshold

In secure multi-party computation, multiple data sources are involved, and a master needs to compute a function over them. This computation is often offloaded to processing nodes, some of which may collude in an attempt to extract private information. Therefore, ensuring the privacy of the data is crucial. In this work, we assume that the data are large matrices, which need to be partitioned into smaller pieces for storage in the processors. Additionally, there is a limited-capacity communication link between the data sources and processors. Consequently, we aim to upload all the data in a single round, while allowing processors to communicate with one another. We propose an approach to matrix multiplication that incorporates Strassen algorithm, enabling us to compute the function with fewer processors while preserving privacy against both the processing nodes and the master. Moreover, our scheme efficiently handles a distributed batch matrix multiplication setting, where an identical function needs to be applied to different datasets.

Authors

Institutions

Publication Details

Published
2025-05-06
DOI
https://doi.org/10.1109/iwcit67595.2025.11072973
Primary Topic
Stochastic Gradient Optimization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Limited-Sharing Multi-Party Computation With Reduced Recovery Threshold

Seyed Reza Hoseini Najarkolaei, Mohammad Hossein Yassaee, Mohammadreza Aref, Mohammad Amin Sarzaeem
Stochastic Gradient Optimization Techniques
article

Limited-Sharing Multi-Party Computation With Reduced Recovery Threshold

Seyed Reza Hoseini Najarkolaei, Mohammad Hossein Yassaee, Mohammadreza Aref, Mohammad Amin Sarzaeem
article en

Abstract

In secure multi-party computation, multiple data sources are involved, and a master needs to compute a function over them. This computation is often offloaded to processing nodes, some of which may collude in an attempt to extract private information. Therefore, ensuring the privacy of the data is crucial. In this work, we assume that the data are large matrices, which need to be partitioned into smaller pieces for storage in the processors. Additionally, there is a limited-capacity communication link between the data sources and processors. Consequently, we aim to upload all the data in a single round, while allowing processors to communicate with one another. We propose an approach to matrix multiplication that incorporates Strassen algorithm, enabling us to compute the function with fewer processors while preserving privacy against both the processing nodes and the master. Moreover, our scheme efficiently handles a distributed batch matrix multiplication setting, where an identical function needs to be applied to different datasets.

Sharif University of Technology (IR)
Openalex Percentile: Top 92%
Stochastic Gradient Optimization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.