Reference : PSS Is Secure against Random Fault Attacks
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/12503
PSS Is Secure against Random Fault Attacks
English
Coron, Jean-Sébastien mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Mandal, Avradip [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2009
Proceedings of Asiacrypt 2009
Springer
653-666
Yes
978-3-642-10365-0
Asiacrypt 2009
2009
Tokyo
Japan
[en] A fault attack consists in inducing hardware malfunctions in order to recover secrets from electronic devices. One of the most famous fault attack is Bellcore’s attack against RSA with CRT; it consists in inducing a fault modulo p but not modulo q at signature generation step; then by taking a gcd the attacker can recover the factorization of N?=?pq. The Bellcore attack applies to any encoding function that is deterministic, for example FDH. Recently, the attack was extended to randomized encodings based on the iso/iec 9796-2 signature standard. Extending the attack to other randomized encodings remains an open problem. In this paper, we show that the Bellcore attack cannot be applied to the PSS encoding; namely we show that PSS is provably secure against random fault attacks in the random oracle model, assuming that inverting RSA is hard.
http://hdl.handle.net/10993/12503
5912
Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009. Proceedings

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
pssfault.pdfPublisher postprint176.86 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.