On the equivalence of authentication codes and robust (2,2)-threshold schemes

10/12/2019
by   Maura B. Paterson, et al.
0

In this paper, we show a "direct" equivalence between certain authentication codes and robust secret sharing schemes. It was previously known that authentication codes and robust secret sharing schemes are closely related to similar types of designs, but direct equivalences had not been considered in the literature. Our new equivalences motivate the consideration of a certain "key-substitution attack." We study this attack and analyze it in the setting of "dual authentication codes." We also show how this viewpoint provides a nice way to prove properties and generalizations of some known constructions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2021

Secret sharing schemes from hypersurfaces over finite fields

Linear error-correcting codes can be used for constructing secret sharin...
research
11/08/2022

Several classes of projective few-weight linear codes and their applications

It is well-known that few-weight linear codes have better applications i...
research
08/26/2023

SoK: Authenticated Prefix Relations – A Unified Perspective On Relative Time-Stamping and Append-Only Logs

Secure relative timestamping and secure append-only logs are two histori...
research
07/22/2020

Exploiting Behavioral Side-Channels in Observation Resilient Cognitive Authentication Schemes

Observation Resilient Authentication Schemes (ORAS) are a class of share...
research
08/29/2023

Better Prefix Authentication

We present new schemes for solving prefix authentication and secure rela...
research
05/07/2021

Leakage-Resilient Secret Sharing with Constant Share Size

We consider the leakage resilience of AG code-based ramp secret sharing ...

Please sign up or login with your details

Forgot password? Click here to reset