Algebraic Geometry Codes for Secure Distributed Matrix Multiplication
Loading...
Access rights
openAccess
CC BY
CC BY
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
10
Series
IEEE Transactions on Information Theory, Volume 71, issue 4, pp. 2373-2382
Abstract
In this paper, we propose a novel construction for secure distributed matrix multiplication (SDMM) based on algebraic geometry (AG) codes, which we call the PoleGap SDMM scheme. The proposed construction is inspired by the Gap Additive Secure Polynomial (GASP) code, where so-called gaps in a certain polynomial are utilized to achieve higher communication rates. Our construction considers the gaps in a Weierstrass semigroup of a rational place in an algebraic function field to achieve a similar increase in the rate. This construction shows that there is potential in utilizing AG codes and their subcodes in SDMM since we demonstrate a better performance compared to state-of-the-art schemes in some parameter regimes.Description
Keywords
Other note
Citation
Makkonen, O, Sacikara, E & Hollanti, C 2025, 'Algebraic Geometry Codes for Secure Distributed Matrix Multiplication', IEEE Transactions on Information Theory, vol. 71, no. 4, pp. 2373-2382. https://doi.org/10.1109/TIT.2025.3535091