Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Joerg Kliewer"'
Publikováno v:
IEEE Transactions on Information Forensics and Security. 17:2110-2124
Publikováno v:
IEEE Transactions on Communications. 69:3502-3516
Linear nested codes, where two or more sub-codes are nested in a global code, have been proposed as candidates for reliable multi-terminal communication. In this paper, we consider nested array-based spatially coupled low-density parity-check (SC-LDP
Autor:
Elza Erkip, Deniz Gunduz, Stratis Ioannidis, Joerg Kliewer, Derya Malak, Muriel Medard, R. Srikant
Publikováno v:
IEEE Journal on Selected Areas in Information Theory. 2:1075-1077
Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the sensitive mes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87131cb4e9256137f570306d554e8fbd
Publikováno v:
ITW
We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate, which are bas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5dce5d17deda6d46b64d4e33c201c181
Publikováno v:
Aliasgari, M, Simeone, O & Kliewer, J 2020, ' Private and Secure Distributed Matrix Multiplication with Flexible Communication Load ', IEEE Transactions on Information Forensics and Security, vol. 15, 8985291, pp. 2722-2734 . https://doi.org/10.1109/TIFS.2020.2972166
Large matrix multiplications are central to large-scale machine learning applications. These operations are often carried out on a distributed computing platform with a master server and multiple workers in the cloud operating in parallel. For such d
Publikováno v:
ISIT
We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability between source symbols. The information leakage is measured by the ratio
Publikováno v:
2021 IEEE International Symposium on Information Theory (ISIT)
ISIT
ISIT
Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales doubly-expo
Publikováno v:
ISIT
In unsecured communications settings, ascertaining the trustworthiness of received information, called authentication, is paramount. We consider keyless authentication over an arbitrarily-varying channel, where channel states are chosen by a maliciou
Publikováno v:
CNS
In this paper, we present results on the authentication capacity region for the two-user arbitrarily-varying multipleaccess channel. We first consider a standard definition of authentication, in which the receiver may discard both messages if an adve