Camilla Hollanti
Aalto-yliopisto
H-index: 22
Europe-Finland
Top articles of Camilla Hollanti
Title | Journal | Author(s) | Publication Date |
---|---|---|---|
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack | arXiv preprint arXiv:2402.02871 | Neehar Verma Camilla Hollanti | 2024/2/5 |
General framework for linear secure distributed matrix multiplication with byzantine servers | IEEE Transactions on Information Theory | Okko Makkonen Camilla Hollanti | 2024/1/29 |
Approximate Gradient Coding for Privacy-Flexible Federated Learning with Non-IID Data | arXiv preprint arXiv:2404.03524 | Okko Makkonen Sampo Niemelä Camilla Hollanti Serge Kas Hanna | 2024/4/4 |
Algebraic geometry codes for secure distributed matrix multiplication | arXiv preprint arXiv:2303.15429 | Okko Makkonen Elif Saçıkara Camilla Hollanti | 2023/3/27 |
N-sum box: An abstraction for linear computation over many-to-one quantum networks | Matteo Allaix Yuxiang Lu Yuhang Yao Tefjol Pllaha Camilla Hollanti | 2023/12/4 | |
Euclidean lattices: theory and applications | Communications in Mathematics | Lenny Fukshansky Camilla Hollanti | 2023/10/18 |
Secure distributed gram matrix multiplication | Okko Makkonen Camilla Hollanti | 2023/4/23 | |
Private information retrieval from colluding and byzantine servers with binary reed–muller codes | Perttu Saarela Matteo Allaix Ragnar Freij-Hollanti Camilla Hollanti | 2022/6/26 | |
Analog secure distributed matrix multiplication over complex numbers | Okko Makkonen Camilla Hollanti | 2022/6/26 | |
Private and secure distributed matrix multiplication schemes for replicated or MDS-coded servers | IEEE Transactions on Information Forensics and Security | Malihe Aliasgari Osvaldo Simeone Jörg Kliewer | 2020/2/6 |
Efficient recovery of a shared secret via cooperation: Applications to SDMM and PIR | IEEE Journal on Selected Areas in Communications | Jie Li Okko Makkonen Camilla Hollanti Oliver W Gnilke | 2022/1/14 |
On the capacity of quantum private information retrieval from MDS-coded and colluding servers | arXiv preprint arXiv:2106.14719 | Matteo Allaix Seunghoan Song Lukas Holzbaur Tefjol Pllaha Masahito Hayashi | 2021/6/28 |
Dense generic well-rounded lattices | arXiv preprint arXiv:2107.00958 | Camilla Hollanti Guillermo Mantilla-Soler Niklas Miller | 2021/7/2 |
A Generic Transformation for Optimal Node Repair in MDS Array Codes Over F2 | IEEE Transactions on Communications | Jie Li Xiaohu Tang Camilla Hollanti | 2021/11/8 |
Cyclic flats of binary matroids | Advances in Applied Mathematics | Ragnar Freij-Hollanti Matthias Grezet Camilla Hollanti Thomas Westerbäck | 2021/6/1 |
Toward the capacity of private information retrieval from coded and colluding servers | IEEE Transactions on Information Theory | Lukas Holzbaur Ragnar Freij-Hollanti Jie Li Camilla Hollanti | 2021/10/14 |
Well-rounded lattices: Towards optimal coset codes for Gaussian and fading wiretap channels | IEEE Transactions on Information Theory | Mohamed Taoufiq Damir Alex Karrila Laia Amoros Oliver W Gnilke David Karpuk | 2021/2/16 |
Even Unimodular Lattices from Quaternion Algebras | arXiv preprint arXiv:2109.09993 | Laia Amorós M Taoufiq Damir Camilla Hollanti | 2021/9/21 |
The complete hierarchical locality of the punctured simplex code | Designs, Codes and Cryptography | Matthias Grezet Camilla Hollanti | 2021/1 |
Improved private and secure distributed matrix multiplication | Jie Li Camilla Hollanti | 2021/7/12 |