2014 | OriginalPaper | Buchkapitel
Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions
verfasst von : Nilanjan Datta, Mridul Nandi
Erschienen in: Provable Security
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In FSE’10, Nandi proved a sufficient condition of pseudo random function (PRF) for affine domain extensions (ADE), a wide class of blockcipher based domain extensions. This sufficient condition is satisfied by all known ADE, however, it is not a characterization of PRF. In this paper we completely characterize the ADE and show that weaker security notions
message authentication code (MAC) and weakly collision resistant (WCR) are indeed equivalent to PRF
.