Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes

Autor: Eimear Byrne, Oliver W. Gnilke, Jörg Kliewer

Publikováno v: Entropy, Vol 25, Iss 2, p 266 (2023)

Large matrix multiplications commonly take place in large-scale machine-learning applications. Often, the sheer size of these matrices prevent carrying out the multiplication at a single server. Therefore, these operations are typically offloaded to

Externí odkaz: https://doaj.org/article/4e52707afabe43559f1da1f0f8a97f26

Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR

Autor: Jie Li, Okko Makkonen, Camilla Hollanti, Oliver W. Gnilke

Publikováno v: Li, J, Makkonen, O, Hollanti, C & Gnilke, O W 2022, ' Efficient Recovery of a Shared Secret via Cooperation : Applications to SDMM and PIR ', IEEE Journal on Selected Areas in Communications, vol. 40, no. 3, pp. 871-884 . https://doi.org/10.1109/JSAC.2022.3142366

This work considers the problem of privately outsourcing the computation of a matrix product over a finite field $\mathbb{F}_q$ to $N$ helper servers. These servers are considered to be honest but curious, i.e., they behave according to the protocol

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95f80e85927c51072d84fc02a60f39ef
http://arxiv.org/abs/2106.05785

$t$-private information retrieval schemes using transitive codes

Autor: Ragnar Freij-Hollanti, Camilla Hollanti, David Karpuk, Oliver W. Gnilke, Ivo Kubjas, Anna-Lena Horlemann-Trautmann

Publikováno v: IEEE Transactions on Information Theory. 65:2107-2118

Private information retrieval (PIR) schemes for coded storage with colluding servers are presented, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed, and the resulting PIR rate i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31bb85e67d4623df434124eba8cb5db6
https://doi.org/10.1109/tit.2018.2871050

Private Proximity Retrieval

Autor: Oliver W. Gnilke, Eitan Yaakobi, Tuvi Etzion, Yiwei Zhang, David Karpuk

Publikováno v: Etzion, T, Gnilke, O W, Karpuk, D, Yaakobi, E & Zhang, Y 2019, Private Proximity Retrieval . in 2019 IEEE International Symposium on Information Theory, ISIT 2019-Proceedings ., 8849249, IEEE Signal Processing Society, IEEE International Symposium on Information Theory-Proceedings, vol. 2019-July, pp. 2119-2123, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 07/07/2019 . https://doi.org/10.1109/ISIT.2019.8849249
ISIT

A private proximity retrieval (PPR) scheme is a protocol which allows a user to retrieve the identities of all records in a database that are within some distance r from the user's record x. The user's privacy at each server is given by the fraction

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c2ea6f1736c4b97fd4f7d7ef8525ec5
https://vbn.aau.dk/da/publications/1d393703-525b-483a-9f05-b48ce4b1ad5e

Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers

Autor: Camilla Hollanti, Razane Tajeddine, David Karpuk, Ragnar Freij-Hollanti, Oliver W. Gnilke

Publikováno v: ISIT

A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used for symmetric PIR in the same setting. An explicit scheme using an $[n,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f776551a957647f1222a6dc9580068c2
https://doi.org/10.1109/isit.2018.8437670