Secure Coded Distributed Computing

TL;DR

This paper introduces methods to enhance security in distributed computing by ensuring confidentiality of intermediate data during shuffling and secure recovery of necessary information while maintaining efficiency.

Contribution

It proposes new secure distributed computing techniques that protect intermediate data confidentiality and optimize communication and computation tradeoffs.

Findings

Achievable limits on communication and computation tradeoffs

Secure data shuffling method ensuring IV confidentiality

Secure IV recovery with minimal overhead

Abstract

In this paper, we consider two critical aspects of security in the distributed computing (DC) model: secure data shuffling and secure coded computing. It is imperative that any external entity overhearing the transmissions does not gain any information about the intermediate values (IVs) exchanged during the shuffling phase of the DC model. Our approach ensures IV confidentiality during data shuffling. Moreover, each node in the system must be able to recover the IVs necessary for computing its output functions but must also remain oblivious to the IVs associated with output functions not assigned to it. We design secure DC methods and establish achievable limits on the tradeoffs between the communication and computation loads to contribute to the advancement of secure data processing in distributed systems.