Paper 2019/1191
On the equivalence of authentication codes and robust (2,2)-threshold schemes
Maura B. Paterson and Douglas R. Stinson
Abstract
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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- combinatorial cryptographyauthentication codessecret sharing
- Contact author(s)
- dstinson @ uwaterloo ca
- History
- 2019-10-15: received
- Short URL
- https://ia.cr/2019/1191
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/1191,
author = {Maura B. Paterson and Douglas R. Stinson},
title = {On the equivalence of authentication codes and robust (2,2)-threshold schemes},
howpublished = {Cryptology ePrint Archive, Paper 2019/1191},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/1191}},
url = {https://eprint.iacr.org/2019/1191}
}
