258 citations · 443 across the 16 of their papers we have counts for
18 papers
Enumerating Inclusion-Maximal Arithmetic Progressions
Brian Bemman, Maximilien Gadouleau, Oliver W. Gnilke +1
We present a simple enumeration algorithm for solving a problem from mathematical and computational music analysi…
Invariants of Quadratic Forms and applications in Design Theory
Oliver W. Gnilke, Padraig O Cathain, Oktay Olmez +1
The study of regular incidence structures such as projective planes and symmetric block designs is a well established topic in discrete mathematics. Work of Bruck, Ryser and Chowla…
Cryptographic Group and Semigroup Actions
Oliver W. Gnilke, Jens Zumbrägel
We consider actions of a group or a semigroup on a set, which generalize the setup of discrete logarithm based cryptosystems. Such cryptographic group actions have gained increasin…
Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR
Jie Li, Okko Makkonen, Camilla Hollanti +1
This work considers the problem of privately outsourcing the computation of a matrix product over a finite field to helper servers. These servers are considered…
Low-Complexity PIR Using Subfield Subcodes
Christian J. Lex, Oliver W. Gnilke
A major drawback of many PIR schemes is the highcomputational cost at the servers. We present a scheme that usesonly operations in the prime field during response generation.For bi…
On Decoding of Generalized Concatenated Codes and Matrix-Product Codes
Ferdinand Blomqvist, Oliver W. Gnilke, Marcus Greferath
Generalized concatenated codes were introduced in the 1970s by Zinoviev. There are many types of codes in the literature that are known by other names that can be viewed as general…
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2
The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an …
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2
A private information retrieval (PIR) scheme on coded storage systems with colluding, byzantine, and non-responsive servers is presented. Furthermore, the scheme can also be used f…
t-Private Information Retrieval Schemes Using Transitive Codes
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti +3
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR sc…
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules
Oliver W. Gnilke, Marcus Greferath, Thomas Honold +2
We give a sufficient condition for a bi-invariant weight on a Frobenius bimodule to satisfy the extension property. This condition applies to bi-invariant weights on a finite Frobe…
Improved User-Private Information Retrieval via Finite Geometry
Oliver Gnilke, Marcus Greferath, Camilla Hollanti +3
In a User-Private Information Retrieval (UPIR) scheme, a set of users collaborate to retrieve files from a database without revealing to observers which participant in the scheme r…
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +3
In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid…
Private Information Retrieval from Coded Databases with Colluding Servers
Ragnar Freij-Hollanti, Oliver Gnilke, Camilla Hollanti +1
We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme according to the suspected n…
Well-Rounded Lattices for Coset Coding in MIMO Wiretap Channels
Oliver W. Gnilke, Amaro Barreal, Alex Karrila +3
The concept of well-rounded lattices has recently found important applications in the setting of a fading single-input single-output (SISO) wiretap channel. It has been shown that,…
Well-Rounded Lattices for Reliability and Security in Rayleigh Fading SISO Channels
Oliver Wilhelm Gnilke, Ha Thanh Nguyen Tran, Alex Karrila +1
For many wiretap channel models asymptotically optimal coding schemes are known, but less effort has been put into actual realizations of wiretap codes for practical parameters. Bo…
Nested Lattice Codes for Vector Perturbation Systems
David A. Karpuk, Amaro Barreal, Oliver W. Gnilke +1
Vector perturbation is an encoding method for broadcast channels in which the transmitter solves a shortest vector problem in a lattice to create a perturbation vector, which is th…
Private Information Retrieval from MDS Coded Data in Distributed Storage Systems
Razan Tajeddine, Oliver W. Gnilke, Salim El Rouayheb
The problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed storage system (DSS), is considered. The DSS is code…
Mosaics of Combinatorial Designs
Oliver W. Gnilke, Marcus Greferath, Mario Osvin Pavčević
Looking at incidence matrices of - designs as matrices with possible entries, each of which indicates incidences of a -design, we introduce the noti…