On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints

DOI10.1109/TSP.2019.2929467OpenAlexW2963474987WikidataQ123024997 ScholiaQ123024997MaRDI QIDQ5239010FDOQ5239010

Rafael F. Schaefer, H. Vincent Poor, Holger Boche, Sebastian Baur

Publication date: 28 October 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2019.2929467

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited In (2)

• Message transmission over classical quantum channels with a jammer with side information: Correlation as resource, common randomness generation
• A storage complexity based analogue of Maurer key establishment using public channels

This page was built for publication: On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239010)