Secure broadcasting of a common message with independent secret keys

Rafael F. Schaefer, Ashish Khisti

Publikation: KonferenzbeitragPapierBegutachtung

7 Zitate (Scopus)

Abstract

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed where a common message has to be broadcasted to two legitimate receivers, while keeping an external eavesdropper ignorant of it. The transmitter shares independent secret keys of arbitrary rates with both legitimate receivers, which can be used in different ways: They can be used as one-time pads to encrypt the common message or they can be used as randomization resources for wiretap coding. Both approaches are studied in this paper. If both legitimate channels are degraded versions of the eavesdropper channel, it is shown that the one-time pad approach is optimal for several cases yielding corresponding capacity expressions. Reversely, the wiretap coding approach is shown to be optimal if the eavesdropper channel is degraded with respect to both legitimate channels establishing capacity in this case as well.

OriginalspracheEnglisch
DOIs
PublikationsstatusVeröffentlicht - 2014
Extern publiziertJa
Veranstaltung2014 48th Annual Conference on Information Sciences and Systems, CISS 2014 - Princeton, NJ, USA/Vereinigte Staaten
Dauer: 19 März 201421 März 2014

Konferenz

Konferenz2014 48th Annual Conference on Information Sciences and Systems, CISS 2014
Land/GebietUSA/Vereinigte Staaten
OrtPrinceton, NJ
Zeitraum19/03/1421/03/14

Fingerprint

Untersuchen Sie die Forschungsthemen von „Secure broadcasting of a common message with independent secret keys“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren