Zobrazeno 1 - 10
of 30
pro vyhledávání: '"David Karpuk"'
Autor:
Alex Karrila, David Karpuk, Oliver W. Gnilke, Mohamed Taoufiq Damir, Laia Amorós, Camilla Hollanti
Publikováno v:
Damir, M T, Karrila, A, Amoros, L, Gnilke, O, Karpuk, D & Hollanti, C 2021, ' Well-Rounded Lattices : Towards Optimal Coset Codes for Gaussian and Fading Wiretap Channels ', IEEE Transactions on Information Theory, vol. 67, no. 6, 9354828, pp. 3645-3663 . https://doi.org/10.1109/TIT.2021.3059749
The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage and error
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1ac5434e57df72768a73f97552f9199c
https://doi.org/10.1109/tit.2021.3059749
https://doi.org/10.1109/tit.2021.3059749
Autor:
Tristram Bogart, Anna-Lena Horlemann-Trautmann, David Karpuk, Alessandro Neri, Mauricio Velasco
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:2946-2970
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d428c9139a0d858609c5342dbc6d051e
https://doi.org/10.1137/20m1356658
https://doi.org/10.1137/20m1356658
Publikováno v:
IEEE Transactions on Communications. 68:3415-3425
Private information retrieval (PIR) is the problem of privately retrieving one out of $M$ original files from $N$ severs, i.e., each individual server learns nothing about the file that the user is requesting. Usually, the $M$ files are replicated or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::419c8159b016b5df06f330c44111775c
https://doi.org/10.1109/tcomm.2020.2980833
https://doi.org/10.1109/tcomm.2020.2980833
Publikováno v:
Tajeddine, R, Gnilke, O W, Karpuk, D, Freij-Hollanti, R & Hollanti, C 2019, ' Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers ', IEEE Transactions on Information Theory, vol. 65, no. 6, 8598994, pp. 3898-3906 . https://doi.org/10.1109/TIT.2018.2890285
The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an $[n,k]$ Reed-Solomon storage code is designed, protecting against $t$-collusi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0f0b302c14d95e1c4cc29e025217fd7
https://doi.org/10.1109/tit.2018.2890285
https://doi.org/10.1109/tit.2018.2890285
Autor:
Ragnar Freij-Hollanti, Camilla Hollanti, David Karpuk, Oliver W. Gnilke, Ivo Kubjas, Anna-Lena Horlemann-Trautmann
Publikováno v:
IEEE Transactions on Information Theory. 65:2107-2118
Private information retrieval (PIR) schemes for coded storage with colluding servers are presented, which are not restricted to maximum distance separable (MDS) codes. PIR schemes for general linear codes are constructed, and the resulting PIR rate i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31bb85e67d4623df434124eba8cb5db6
https://doi.org/10.1109/tit.2018.2871050
https://doi.org/10.1109/tit.2018.2871050
Publikováno v:
ITW
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94724f24d611e48c7c473cb7c27518dc
Publikováno v:
CNS
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. In this paper, we answer the following question: Is it beneficial to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37736d03d962953812a4d48bd31c075
Autor:
David Karpuk, Peter Moss
Publikováno v:
IEEE Transactions on Broadcasting. 63(3):494-506
We study channel pre-inversion and vector perturbation (VP) schemes for large-scale broadcast channels, wherein a transmitter has ${M}$ transmit antennas and is transmitting to ${K}$ single-antenna non-cooperating receivers. We provide results which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fde6b5cc8416a5db108b8c4d065fab26
https://doi.org/10.1109/TBC.2017.2711139
https://doi.org/10.1109/TBC.2017.2711139
Publikováno v:
ISIT
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinato
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f564474c69421a4de531a6ccd89c7519
https://doi.org/10.1109/isit.2019.8849446
https://doi.org/10.1109/isit.2019.8849446
Publikováno v:
Etzion, T, Gnilke, O W, Karpuk, D, Yaakobi, E & Zhang, Y 2019, Private Proximity Retrieval . in 2019 IEEE International Symposium on Information Theory, ISIT 2019-Proceedings ., 8849249, IEEE Signal Processing Society, IEEE International Symposium on Information Theory-Proceedings, vol. 2019-July, pp. 2119-2123, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 07/07/2019 . https://doi.org/10.1109/ISIT.2019.8849249
ISIT
ISIT
A private proximity retrieval (PPR) scheme is a protocol which allows a user to retrieve the identities of all records in a database that are within some distance r from the user's record x. The user's privacy at each server is given by the fraction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c2ea6f1736c4b97fd4f7d7ef8525ec5
https://vbn.aau.dk/da/publications/1d393703-525b-483a-9f05-b48ce4b1ad5e
https://vbn.aau.dk/da/publications/1d393703-525b-483a-9f05-b48ce4b1ad5e