22 citations · 81 across the 51 of their papers we have counts for
12 papers · 1 filter
Analysis of Communication Channels Related to Physical Unclonable Functions
Georg Maringer, Marvin Xhemrishi, Sven Puchinger +6
Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available…
Concatenated Codes for Multiple Reads of a DNA Sequence
Issam Maarouf, Andreas Lenz, Lorenz Welter +3
Decoding sequences that stem from multiple transmissions of a codeword over an insertion, deletion, and substitution channel is a critical component of efficient deoxyribonucleic a…
Quadratic-Curve-Lifted Reed-Solomon Codes
Hedongliang Liu, Lukas Holzbaur, Nikita Polyanskii +2
Lifted codes are a class of evaluation codes attracting more attention due to good locality and intermediate availability. In this work we introduce and study quadratic-curve-lifte…
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound
Christoph Hofmeister, Rawad Bitar, Marvin Xhemrishi +1
We consider the problem of designing secure and private codes for distributed matrix-matrix multiplication. A master server owns two private matrices and hires worker nodes to help…
Sum-rank product codes and bounds on the minimum distance
Gianira N. Alfarano, F. J. Lobillo, Alessandro Neri +1
The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Spe…
Correctable Erasure Patterns in Product Topologies
Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi +1
Locality enables storage systems to recover failed nodes from small subsets of surviving nodes. The setting where nodes are partitioned into subsets, each allowing for local recove…