Paper Info
Title
Glitch-Resistant Masking Revisited - or Why Proofs in the Robust Probing Model are Needed.
Abstract
We construct efficient and tightly secure pseudorandom functions (PRFs) with only logarithmic security loss and short secret keys. This yields very simple and efficient variants of well-known constructions, including those of Naor-Reingold (FOCS 1997) and Lewko-Waters (ACM CCS 2009). Most importantly, in combination with the construction of Banerjee, Peikert and Rosen (EUROCRYPT 2012) we obtain the currently most efficient LWE-based PRF from a weak LWE-assumption with a much smaller modulus than the original construction. In comparison to the only previous construction with this property, which is due to Dottling and Schroder (CRYPTO 2015), we use a modulus of similar size, but only a single instance of the underlying PRF, instead of Open image in new window parallel instances, where Open image in new window is the security parameter. Like Dottling and Schroder, our security proof is only almost back-box, due to the fact that the number of queries made by the adversary and its advantage must be known a-priori.
Year
Venue
Field
2018
IACR Cryptology ePrint Archive
Discrete mathematics,Matrix (mathematics),Computer science,Theoretical computer science,Adversary,Logarithm,Security parameter,Pseudorandom number generator
DocType
Volume
Citations 
Journal
2018
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Thorben Moos133.51
Amir Moradi201.35
Tobias Schneider3174.83
François-Xavier Standaert43070193.51