Analog Secure Distributed Matrix Multiplication over Complex Numbers

Okko Makkonen; Camilla Hollanti

doi:10.1109/ISIT50566.2022.9834873

Analog Secure Distributed Matrix Multiplication over Complex Numbers

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

5 Citations (Scopus)

150 Downloads (Pure)

Abstract

This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed to be honest-but-curious, i.e., they work according to the protocol, but try to deduce information about the data. The problem of secure distributed matrix multiplication (SDMM) has been considered in the context of matrix multiplication over finite fields, which is not always feasible in real world applications. We present two schemes, which allow for variable degree of security based on the use case and allow for colluding and straggling servers. We analyze the security and the numerical accuracy of the schemes and observe a trade-off between accuracy and security.

Original language	English
Title of host publication	2022 IEEE International Symposium on Information Theory, ISIT 2022
Publisher	IEEE
Pages	1211-1216
Number of pages	6
ISBN (Electronic)	978-1-6654-2159-1
DOIs	https://doi.org/10.1109/ISIT50566.2022.9834873
Publication status	Published - 2022
MoE publication type	A4 Conference publication
Event	IEEE International Symposium on Information Theory - Espoo, Finland Duration: 26 Jun 2022 → 1 Jul 2022

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2022-June
ISSN (Print)	2157-8095

Conference

Conference	IEEE International Symposium on Information Theory
Abbreviated title	ISIT
Country/Territory	Finland
City	Espoo
Period	26/06/2022 → 01/07/2022

Access to Document

10.1109/ISIT50566.2022.9834873

Analog Secure Distributed Matrix Multiplication over Complex NumbersAccepted author manuscript, 397 KB

Cite this

@inproceedings{b3395b19a45344659afac3de3bd84304,

title = "Analog Secure Distributed Matrix Multiplication over Complex Numbers",

abstract = "This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed to be honest-but-curious, i.e., they work according to the protocol, but try to deduce information about the data. The problem of secure distributed matrix multiplication (SDMM) has been considered in the context of matrix multiplication over finite fields, which is not always feasible in real world applications. We present two schemes, which allow for variable degree of security based on the use case and allow for colluding and straggling servers. We analyze the security and the numerical accuracy of the schemes and observe a trade-off between accuracy and security.",

author = "Okko Makkonen and Camilla Hollanti",

note = "Funding Information: This work has been supported by the Academy of Finland, under Grants No. 318937 and 336005. The authors would like to thank Dr. Diego Villamizar Rubiano for useful discussions. Publisher Copyright: {\textcopyright} 2022 IEEE.; IEEE International Symposium on Information Theory, ISIT ; Conference date: 26-06-2022 Through 01-07-2022",

year = "2022",

doi = "10.1109/ISIT50566.2022.9834873",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "IEEE",

pages = "1211--1216",

booktitle = "2022 IEEE International Symposium on Information Theory, ISIT 2022",

address = "United States",

}

Makkonen, O & Hollanti, C 2022, Analog Secure Distributed Matrix Multiplication over Complex Numbers. in 2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE International Symposium on Information Theory - Proceedings, vol. 2022-June, IEEE, pp. 1211-1216, IEEE International Symposium on Information Theory, Espoo, Finland, 26/06/2022. https://doi.org/10.1109/ISIT50566.2022.9834873

Analog Secure Distributed Matrix Multiplication over Complex Numbers. / Makkonen, Okko ; Hollanti, Camilla.
2022 IEEE International Symposium on Information Theory, ISIT 2022. IEEE, 2022. p. 1211-1216 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2022-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Analog Secure Distributed Matrix Multiplication over Complex Numbers

AU - Makkonen, Okko

AU - Hollanti, Camilla

N1 - Funding Information: This work has been supported by the Academy of Finland, under Grants No. 318937 and 336005. The authors would like to thank Dr. Diego Villamizar Rubiano for useful discussions. Publisher Copyright: © 2022 IEEE.

PY - 2022

Y1 - 2022

N2 - This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed to be honest-but-curious, i.e., they work according to the protocol, but try to deduce information about the data. The problem of secure distributed matrix multiplication (SDMM) has been considered in the context of matrix multiplication over finite fields, which is not always feasible in real world applications. We present two schemes, which allow for variable degree of security based on the use case and allow for colluding and straggling servers. We analyze the security and the numerical accuracy of the schemes and observe a trade-off between accuracy and security.

AB - This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed to be honest-but-curious, i.e., they work according to the protocol, but try to deduce information about the data. The problem of secure distributed matrix multiplication (SDMM) has been considered in the context of matrix multiplication over finite fields, which is not always feasible in real world applications. We present two schemes, which allow for variable degree of security based on the use case and allow for colluding and straggling servers. We analyze the security and the numerical accuracy of the schemes and observe a trade-off between accuracy and security.

UR - http://www.scopus.com/inward/record.url?scp=85130539544&partnerID=8YFLogxK

U2 - 10.1109/ISIT50566.2022.9834873

DO - 10.1109/ISIT50566.2022.9834873

M3 - Conference article in proceedings

AN - SCOPUS:85130539544

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1211

EP - 1216

BT - 2022 IEEE International Symposium on Information Theory, ISIT 2022

PB - IEEE

T2 - IEEE International Symposium on Information Theory

Y2 - 26 June 2022 through 1 July 2022

ER -

Analog Secure Distributed Matrix Multiplication over Complex Numbers

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Hollanti_ICT: Secure Distributed Computation Schemes with Applications to Digitalized Remote Healthcare

Cite this

Analog Secure Distributed Matrix Multiplication over Complex Numbers

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Projects

Hollanti_ICT: Secure Distributed Computation Schemes with Applications to Digitalized Remote Healthcare

Cite this