Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Camilla Hollanti"'
Autor:
Dejan Vukobratovic, Dusan Jakovetic, Vitaly Skachek, Dragana Bajovic, Dino Sejdinovic, Gunes Karabulut Kurt, Camilla Hollanti, Ingo Fischer
Publikováno v:
IEEE Access, Vol 4, Pp 3360-3378 (2016)
In forthcoming years, the Internet of Things (IoT) will connect billions of smart devices generating and uploading a deluge of data to the cloud. If successfully extracted, the knowledge buried in the data can significantly improve the quality of lif
Externí odkaz:
https://doaj.org/article/1d8312e83e3840adb2bac8bb73b5b706
Autor:
Francisco A. Monteiro, Alister Burr, Ioannis Chatzigeorgiou, Camilla Hollanti, Ioannis Krikidis, Hulya Seferoglu, Vitaly Skachek
Publikováno v:
EURASIP Journal on Advances in Signal Processing, Vol 2017, Iss 1, Pp 1-3 (2017)
Abstract Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols
Externí odkaz:
https://doaj.org/article/905b7acd9dc347eea36c546cd4f3a006
Publikováno v:
IEEE Transactions on Information Theory. 68:517-537
In this work, two practical concepts related to private information retrieval (PIR) are introduced and coined full support-rank PIR and strongly linear PIR. Being of full support-rank is a technical, yet natural condition required to prove a converse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c648d9cae48e2e686354555a029db9b8
https://doi.org/10.1109/tit.2021.3120316
https://doi.org/10.1109/tit.2021.3120316
Autor:
Jie Li, Camilla Hollanti
Publikováno v:
IEEE Transactions on Information Forensics and Security. 17:659-669
In this paper, we study the problem of \emph{private and secure distributed matrix multiplication (PSDMM)}, where a user having a private matrix $A$ and $N$ non-colluding servers sharing a library of $L$ ($L>1$) matrices $B^{(0)}, B^{(1)},\ldots,B^{(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a931cfdce7776d9556da6e2a9f7c580
https://doi.org/10.1109/tifs.2022.3147638
https://doi.org/10.1109/tifs.2022.3147638
Autor:
Okko Makkonen, Camilla Hollanti
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
In this paper, a general framework for linear secure distributed matrix multiplication (SDMM) is introduced. The model allows for a neat treatment of straggling and Byzantine servers via a star product interpretation as well as simplified security pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed42794abace26cef8018603dc048256
https://doi.org/10.1109/itw54588.2022.9965828
https://doi.org/10.1109/itw54588.2022.9965828
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:
Okko Makkonen, Camilla Hollanti
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
This work considers the problem of distributing matrix multiplication over the real or complex numbers to helper servers, such that the information leakage to these servers is close to being information-theoretically secure. These servers are assumed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a03d92396a4966db5ee446065136ea7
https://doi.org/10.1109/isit50566.2022.9834873
https://doi.org/10.1109/isit50566.2022.9834873
Publikováno v:
2022 IEEE International Symposium on Information Theory (ISIT).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed192e5f7e6fe13d912de87d886fc436
https://doi.org/10.1109/isit50566.2022.9834654
https://doi.org/10.1109/isit50566.2022.9834654
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:
SIAM Journal on Applied Algebra and Geometry. 4:471-501
Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code design in various wireless communication setups. However, the theta se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::596a32b3a581850e62cd0d72d812a732
https://doi.org/10.1137/19m1275334
https://doi.org/10.1137/19m1275334