Wiretap Codes for Secure Multi-Party Computation
2014 (English)In: Globecom Workshops (GC Wkshps), 2014, IEEE conference proceedings, 2014Conference paper (Refereed)
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.
IdentifiersURN: urn:nbn:se:kth:diva-165437DOI: 10.1109/GLOCOMW.2014.7063621ScopusID: 2-s2.0-84946689231OAI: oai:DiVA.org:kth-165437DiVA: diva2:808419
IEEE Globecom 2014,8-12 Dec. 2014, Austin Texas