Private information retrieval from MDS coded data in distributed storage systems R Tajeddine, OW Gnilke, S El Rouayheb IEEE Transactions on Information Theory 64 (11), 7081-7093, 2018 | 258 | 2018 |
Private information retrieval from coded databases with colluding servers R Freij-Hollanti, OW Gnilke, C Hollanti, DA Karpuk SIAM Journal on Applied Algebra and Geometry 1 (1), 647-664, 2017 | 252 | 2017 |
Private information retrieval schemes for coded data with arbitrary collusion patterns R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti, ... Information Theory (ISIT), 2017 IEEE International Symposium on, 1908-1912, 2017 | 102 | 2017 |
Private information retrieval from coded storage systems with colluding, Byzantine, and unresponsive servers R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti IEEE Transactions on information theory 65 (6), 3898-3906, 2019 | 97 | 2019 |
-private information retrieval schemes using transitive codes R Freij-Hollanti, OW Gnilke, C Hollanti, AL Horlemann-Trautmann, ... IEEE Transactions on Information Theory 65 (4), 2107-2118, 2018 | 36 | 2018 |
Well-rounded lattices for reliability and security in Rayleigh fading SISO channels OW Gnilke, HTN Tran, A Karrila, C Hollanti 2016 IEEE Information Theory Workshop (ITW), 359-363, 2016 | 25 | 2016 |
Robust private information retrieval from coded systems with byzantine and colluding servers R Tajeddine, OW Gnilke, D Karpuk, R Freij-Hollanti, C Hollanti 2018 IEEE International Symposium on Information Theory (ISIT), 2451-2455, 2018 | 23 | 2018 |
Well-rounded lattices: Towards optimal coset codes for Gaussian and fading wiretap channels MT Damir, A Karrila, L Amoros, OW Gnilke, D Karpuk, C Hollanti IEEE Transactions on Information Theory 67 (6), 3645-3663, 2021 | 16 | 2021 |
Well-rounded lattices for coset coding in MIMO wiretap channels OW Gnilke, A Barreal, A Karrila, HTN Tran, DA Karpuk, C Hollanti 2016 26th International Telecommunication Networks and Applications …, 2016 | 14 | 2016 |
Straggler-and adversary-tolerant secure distributed matrix multiplication using polynomial codes E Byrne, OW Gnilke, J Kliewer Entropy 25 (2), 266, 2023 | 9 | 2023 |
Mosaics of combinatorial designs OW Gnilke, M Greferath, MO Pavčević Designs, codes and cryptography 86, 85-95, 2018 | 9 | 2018 |
The extension theorem for bi-invariant weights over Frobenius rings and Frobenius bimodules OW Gnilke, M Greferath, T Honold, JA Wood, J Zumbrägel arXiv preprint arXiv:1711.09939, 2017 | 8 | 2017 |
Analysis of some well-rounded lattices in wiretap channels MT Damir, O Gnilke, L Amorós, C Hollanti 2018 IEEE 19th International Workshop on Signal Processing Advances in …, 2018 | 6 | 2018 |
The semigroup action problem in cryptography OW Gnilke University College Dublin, 2014 | 5 | 2014 |
Efficient recovery of a shared secret via cooperation: Applications to SDMM and PIR J Li, O Makkonen, C Hollanti, OW Gnilke IEEE Journal on Selected Areas in Communications 40 (3), 871-884, 2022 | 4 | 2022 |
Reed-Muller Codes for Private Information Retrieval R Freij-Hollanti, O Gnilke, C Hollanti, AL Horlemann-Trautmann, D Karpuk, ... International Workshop on Coding and Cryptography, 2017 | 4 | 2017 |
Cryptographic group and semigroup actions OW Gnilke, J Zumbrägel arXiv preprint arXiv:2301.01657, 2023 | 3 | 2023 |
Private proximity retrieval T Etzion, OW Gnilke, D Karpuk, E Yaakobi, Y Zhang 2019 IEEE International Symposium on Information Theory (ISIT), 2119-2123, 2019 | 3 | 2019 |
Improved user-private information retrieval via finite geometry OW Gnilke, M Greferath, C Hollanti, G Nuñez Ponasso, P Ó Catháin, ... Designs, Codes and Cryptography 87, 665-677, 2019 | 3 | 2019 |
Low-complexity PIR using subfield subcodes CJ Lex, OW Gnilke arXiv preprint arXiv:2105.07369, 2021 | 2 | 2021 |