Constructions of Beyond-Birthday Secure PRFs from Random Permutations, Revisited
Keyword(s):
In CRYPTO 2019, Chen et al. showed how to construct pseudorandom functions (PRFs) from random permutations (RPs), and they gave one beyond-birthday secure construction from sum of Even-Mansour, namely SoEM22 in the single-key setting. In this paper, we improve their work by proving the multi-key security of SoEM22, and further tweaking SoEM22 but still preserving beyond birthday bound (BBB) security. Furthermore, we use only one random permutation to construct parallelizable and succinct beyond-birthday secure PRFs in the multi-key setting, and then tweak this new construction. Moreover, with a slight modification of our constructions of tweakable PRFs, two parallelizable nonce based MACs for variable length messages are obtained.
2018 ◽
Vol 39
(3)
◽
pp. 1246-1275
◽
2015 ◽
Vol 15
(1)
◽
pp. 21
2007 ◽
Vol DMTCS Proceedings vol. AH,...
(Proceedings)
◽
2012 ◽
Vol 21
(5)
◽
pp. 715-733
◽
Keyword(s):
2013 ◽
Vol 23
(2)
◽
pp. 201-222
◽
2016 ◽
Vol 26
(1)
◽
pp. 24-51
◽
2011 ◽
Vol DMTCS Proceedings vol. AO,...
(Proceedings)
◽