Change search
ReferencesLink to record
Permanent link

Direct link
Wiretap Codes for Secure Multi-Party Computation
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0001-9307-484X
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
KTH, School of Electrical Engineering (EES), Automatic Control.ORCID iD: 0000-0003-1835-2963
2014 (English)In: Globecom Workshops (GC Wkshps), 2014, IEEE conference proceedings, 2014Conference paper (Refereed)
Abstract [en]

In this paper, we propose a new secret sharing scheme for secure multi-party computation. We present a general framework that allows us to construct efficient secret sharing schemes from channel coding techniques for the wiretap channel. The resulting schemes can be employed to securely calculate linear functions of data that are distributed in a network without leaking any information on the data except the desired result. For the examples considered in this paper, our schemes minimize the communication overhead while keeping the data perfectly secure. Compared to conventional schemes, for which the communication overhead grows quadratically in the number of clients in the considered scenarios, the communication overhead for our approach grows only linearly with the number of clients. This property is maintained even if our secret sharing scheme is set up to introduce redundancy in order to compensate for losses of secret shares. While we only consider the case of passive eavesdroppers and implementations based on nested Reed-Solomon codes in this paper, the proposed framework can also be applied in other cases (e.g., when clients tamper with the data) by taking into account the effects of attacks in the design of the underlying wiretap code.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2014.
National Category
URN: urn:nbn:se:kth:diva-165437DOI: 10.1109/GLOCOMW.2014.7063621ScopusID: 2-s2.0-84946689231OAI: diva2:808419
IEEE Globecom 2014,8-12 Dec. 2014, Austin Texas


Available from: 2015-04-28 Created: 2015-04-28 Last updated: 2015-05-21Bibliographically approved

Open Access in DiVA

fulltext(262 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 262 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Search in DiVA

By author/editor
Thobaben, RagnarDán, GyörgySandberg, Henrik
By organisation
Communication TheoryCommunication NetworksAutomatic Control

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 31 hits
ReferencesLink to record
Permanent link

Direct link