# Secure Error Correction using Multi-Party Computation

## TL;DR

This paper introduces a secure multi-party computation error correction method that leverages Berlekamp-Welch codes and Reed-Solomon codes to detect and correct errors during data sharing and computation, enhancing privacy and reliability.

## Contribution

It proposes a novel error correction technique for secure multi-party computation based on established error-correcting codes, improving robustness against communication errors and malicious manipulations.

## Key findings

- Effective error detection and correction in multi-party computation
- Enhanced security against data manipulation and communication errors
- Integration of Berlekamp-Welch and Reed-Solomon codes for privacy-preserving error correction

## Abstract

During recent years with the increase of data and data analysis needs, privacy preserving data analysis methods have become of great importance. Researchers have proposed different methods for this purpose. Secure multi-party computation is one of such techniques that allows a group of parties to evaluate a function on their data without revealing the data. This is done by secret sharing approach, in which parties share a piece of their data using polynomials and after doing function evaluation on shares of data finally they do a Lagrange interpolation to get the result. Two approaches have been proposed in secure multi-party computation for evaluating a function, arithmetic gates and logical gates. In both of them and since communication is an important step in multi-party computation, errors may happen. So, being able to detect and correct errors is important. Moreover, as adversaries may interrupt communication or manipulate the data, either in communication or during computation, this error detection and correction provide participating parties with a technique to detect such errors. Hence, in this paper we present a secure multi-party computation error correcting technique that has the ability to detect and correct errors on players shares. This technique is based on Berlekamp-Welch error correcting codes and we assume that players shares are generated using Reed-Solomon codes.