Abstract
In this work, the application of Luby-Rackoff randomizers for authentication purposes is examined. First randomized authentication codes are introduced. In these codes, the assignment of a cryptogram to a given message is done in two stages. In the first, the redundancy is introduced and in the second, the concatenation of several Luby-Rackoff randomizers is used. Next, perfect A-codes are defined. The quality of the authentication codes (A-codes) is measured using the concept of distinguishing circuits. Three A-codes with different redundancy stages are examined and proven that they are perfect if the suitable number of Luby-Rackoff randomizers is used in the second stage of the A-code.
Cite
CITATION STYLE
Pieprzyk, J., & Safavi-Naini, R. (1991). Randomized authentication systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 547 LNCS, pp. 472–481). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
