ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Two Private Secure Distributed Coded Computation Schemes Using Extension Fields

Mahesh, AA and Malladi, TS and Rajan, BS (2020) Two Private Secure Distributed Coded Computation Schemes Using Extension Fields. In: 2020 IEEE International Conference on Communications, ICC 2020, 7-11 June 2020, Dublin; Ireland.

[img] PDF
iee_int_con_com_2020_2020.pdf - Published Version
Restricted to Registered users only

Download (168kB) | Request a copy
Official URL: https://dx.doi.org/10.1109/ICC40277.2020.9148690


Stragglers, adversaries and colluding workers are some of the key problems affecting the performance of a distributed computing system. There have been many works in reducing the recovery threshold (i.e. minimum number of workers the master needs to wait, to compute the final output), while tackling adversaries and colluding workers for providing security and data privacy. These works generally consider datasets over arbitrary fields i.e. fields of characteristic both zero and prime. In this paper, we show that, for distributed computing problems over finite fields, performing the computations over an appropriately-sized extension field can improve the recovery threshold with a trade off only in computational complexity while preserving the privacy and security parameters. We show this for two schemes: (i) Lagrange coded computing scheme for evaluating an arbitrary multivariate polynomial over a dataset over finite fields, proposed in Q. Yu, N. Raviv, J. So, and A. S. Avestimehr, 'Lagrange coded computing: Optimal design for resiliency, security and privacy,' arXiv:1806.00939v3 and (ii) private secure matrix multiplication discussed in M. Kim, and J. Lee, 'Private Secure Coded Computation,' arXiv:1902.00167. When a proper degree of field extension is chosen, the proposed coding schemes is applicable even in cases where the original schemes are not applicable because of insufficient number of workers or insufficient field size.

Item Type: Conference Paper
Publication: IEEE International Conference on Communications
Publisher: Institute of Electrical and Electronics Engineers Inc.
Additional Information: The copyright of this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords: Data privacy; Lagrange multipliers, Computing scheme; Distributed computing systems; Field extensions; MAtrix multiplication; Multivariate polynomial; Privacy and security; Recovery thresholds; Security and privacy, Economic and social effects
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 01 Sep 2020 11:23
Last Modified: 01 Sep 2020 11:23
URI: http://eprints.iisc.ac.in/id/eprint/66435

Actions (login required)

View Item View Item