Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Datta, N., & Nandi, M. (2014). Equivalence between MAC, WCR and PRF for blockcipher based constructions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8782, 300–308. https://doi.org/10.1007/978-3-319-12475-9_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
