TY - GEN

T1 - On secure computation over the binary modulo-2 adder multiple-access wiretap channel

AU - Goldenbaum, Mario

AU - Boche, Holger

AU - Poor, H. Vincent

PY - 2016/10/21

Y1 - 2016/10/21

N2 - In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matches the algebraic structure of the channel and the joint source distribution fulfills certain conditions, the secrecy computation-capacity equals the computation capacity, which is the supremum of all achievable computation rates without secrecy constraints. Unlike the case of securely transmitting messages, no additional randomness is needed at the encoders nor does the legitimate receiver need any advantage over the eavesdropper. The results therefore show that the problem of securely computing a function over a multiple-access wiretap channel may significantly differ from the one of securely communicating messages.

AB - In this paper, the problem of securely computing a function over the binary modulo-2 adder multiple-access wiretap channel is considered. The problem involves a legitimate receiver that wishes to reliably and efficiently compute a function of distributed binary sources while an eavesdropper has to be kept ignorant of them. In order to characterize the corresponding fundamental limit, the notion of secrecy computation-capacity is introduced. Although determining the secrecy computation-capacity is challenging for arbitrary functions, it surprisingly turns out that if the function perfectly matches the algebraic structure of the channel and the joint source distribution fulfills certain conditions, the secrecy computation-capacity equals the computation capacity, which is the supremum of all achievable computation rates without secrecy constraints. Unlike the case of securely transmitting messages, no additional randomness is needed at the encoders nor does the legitimate receiver need any advantage over the eavesdropper. The results therefore show that the problem of securely computing a function over a multiple-access wiretap channel may significantly differ from the one of securely communicating messages.

KW - Physical-Layer security

KW - Secure distributed computation

KW - computation coding

KW - multiple-access wiretap channel

UR - http://www.scopus.com/inward/record.url?scp=84998910336&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84998910336&partnerID=8YFLogxK

U2 - 10.1109/ITW.2016.7606788

DO - 10.1109/ITW.2016.7606788

M3 - Conference contribution

AN - SCOPUS:84998910336

T3 - 2016 IEEE Information Theory Workshop, ITW 2016

SP - 21

EP - 25

BT - 2016 IEEE Information Theory Workshop, ITW 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE Information Theory Workshop, ITW 2016

Y2 - 11 September 2016 through 14 September 2016

ER -