Book
PSS Is Secure against Random Fault Attacks.
| Title: | PSS Is Secure against Random Fault Attacks. |
|---|---|
| Authors: | Coron, Jean-Sébastien, Mandal, Avradip |
| Source: | Advances in Cryptology - ASIACRYPT 2009; 2009, p653-666, 14p |
| Abstract: | 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Advances in Cryptology - ASIACRYPT 2009 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| DOI: | 10.1007/978-3-642-10366-7_38 |
| Database: | Complementary Index |
Availability