Randomized authentication systems

Authors:
Josef Pieprzyk;Reihaneh Safavi-Naini
Affiliations:
Department of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia and Department of Mathematic, Statistic and Computing, ...;Department of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, ACT, Australia and Department of Mathematic, Statistic and Computing, ...
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 5
Cited 0

How to construct random functions

Journal of the ACM (JACM)
How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
On the construction of block ciphers provably secure and not relying on any unproved hypotheses (extended abstract)

CRYPTO '89 Proceedings on Advances in cryptology
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Error-correcting codes for authentication and subliminal channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.