135 citations · 365 across the 28 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.IT2023
Information-Theoretically Secret Reed-Muller Identification with Affine Designs
Mattia Spandri, Roberto Ferrara, Christian Deppe +2
We consider the problem of information-theoretic secrecy in identification schemes rather than transmission schemes. In identification, large identities are encoded into small chal…
math.CO2023
-Almost collision-flat universal hash functions and mosaics of designs
Moritz Wiese, Holger Boche
We introduce, motivate and study -almost collision-flat (ACFU) universal hash functions . Their main property is that the nu…
cs.IT2023
A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We consider a standard two-source model for uniform common randomness (UCR) generation, in which Alice and Bob observe independent and identically distributed (i.i.d.) samples of a…