Message Authentication Codes from Unpredictable Block Ciphers

@inproceedings{Dodis2009MessageAC,
  title={Message Authentication Codes from Unpredictable Block Ciphers},
  author={Yevgeniy Dodis and John P. Steinberger},
  booktitle={CRYPTO},
  year={2009}
}
We design an efficient mode of operation on block ciphers, SS-NMAC. Our mode has the following properties, when instantiated with a block cipher f to yield a variable-length, keyed hash function H : (1) MAC Preservation. H is a secure message authentication code (MAC) with birthday security, as long as f is unpredictable. (2) PRF Preservation. H is a secure pseudorandom function (PRF) with birthday security, as long as f is pseudorandom. (3) Security against Side-Channels. As long as the block… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS
27 Citations
20 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

How to Build a Permutation-Based Hash Function

  • P. Rogaway, J. Steinberger
  • Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp…
  • 2008
2 Excerpts

Similar Papers

Loading similar papers…