On the equivalence of authentication codes and robust (2, 2)-threshold schemes
In this paper, we show a “direct” equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold schemes are closely related to similar types of designs, but direct equivalences had not been considered in the lite...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-11-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2019-0048 |
id |
doaj-c95d44e8caf44b9285677d2182864f70 |
---|---|
record_format |
Article |
spelling |
doaj-c95d44e8caf44b9285677d2182864f702021-09-22T06:13:10ZengDe GruyterJournal of Mathematical Cryptology1862-29842020-11-0115117919610.1515/jmc-2019-0048jmc-2019-0048On the equivalence of authentication codes and robust (2, 2)-threshold schemesPaterson Maura B.0Stinson Douglas R.1Department of Economics, Mathematics and Statistics Birkbeck, University of London, Malet Street, LondonWC1E 7HX, UKDavid R. Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, CanadaIn this paper, we show a “direct” equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold 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.https://doi.org/10.1515/jmc-2019-0048foundationscombinatorial cryptographyauthentication codessecret sharing05b0505b1094a62 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Paterson Maura B. Stinson Douglas R. |
spellingShingle |
Paterson Maura B. Stinson Douglas R. On the equivalence of authentication codes and robust (2, 2)-threshold schemes Journal of Mathematical Cryptology foundations combinatorial cryptography authentication codes secret sharing 05b05 05b10 94a62 |
author_facet |
Paterson Maura B. Stinson Douglas R. |
author_sort |
Paterson Maura B. |
title |
On the equivalence of authentication codes and robust (2, 2)-threshold schemes |
title_short |
On the equivalence of authentication codes and robust (2, 2)-threshold schemes |
title_full |
On the equivalence of authentication codes and robust (2, 2)-threshold schemes |
title_fullStr |
On the equivalence of authentication codes and robust (2, 2)-threshold schemes |
title_full_unstemmed |
On the equivalence of authentication codes and robust (2, 2)-threshold schemes |
title_sort |
on the equivalence of authentication codes and robust (2, 2)-threshold schemes |
publisher |
De Gruyter |
series |
Journal of Mathematical Cryptology |
issn |
1862-2984 |
publishDate |
2020-11-01 |
description |
In this paper, we show a “direct” equivalence between certain authentication codes and robust threshold schemes. It was previously known that authentication codes and robust threshold 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. |
topic |
foundations combinatorial cryptography authentication codes secret sharing 05b05 05b10 94a62 |
url |
https://doi.org/10.1515/jmc-2019-0048 |
work_keys_str_mv |
AT patersonmaurab ontheequivalenceofauthenticationcodesandrobust22thresholdschemes AT stinsondouglasr ontheequivalenceofauthenticationcodesandrobust22thresholdschemes |
_version_ |
1717371877340479488 |