research
∙
05/16/2023
Unconditionally Secure Non-malleable Secret Sharing and Circular External Difference Families
Various notions of non-malleable secret sharing schemes have been consid...
share
research
∙
11/18/2022
Constructions and bounds for codes with restricted overlaps
Non-overlapping codes have been studied for almost 60 years. In such a c...
research
∙
05/31/2021
Asymmetric All-or-nothing Transforms
In this paper, we initiate a study of asymmetric all-or-nothing transfor...
research
∙
04/22/2021
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
A splitting BIBD is a type of combinatorial design that can be used to c...
research
∙
10/12/2019
On the equivalence of authentication codes and robust (2,2)-threshold schemes
In this paper, we show a "direct" equivalence between certain authentica...
research
∙
07/09/2019
Block-avoiding point sequencings of arbitrary length in Steiner triple systems
An ℓ-good sequencing of an STS(v) is a permutation of the points of the ...
research
∙
11/05/2018
A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes
A repairable threshold scheme (which we abbreviate to RTS) is a (τ,n)-th...
research
∙
03/13/2018
