Making RSA–PSS Provably Secure against Non-random Faults
- 1 January 2014
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Formal verification of a CRT-RSA implementation against fault attacksJournal of Cryptographic Engineering, 2013
- Computer-Aided Security Proofs for the Working CryptographerLecture Notes in Computer Science, 2011
- Modulus Fault Attacks against RSA-CRT SignaturesLecture Notes in Computer Science, 2011
- Fault Attacks and Countermeasures on Vigilant's RSA-CRT AlgorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- PSS Is Secure against Random Fault AttacksLecture Notes in Computer Science, 2009
- Fault Attacks on RSA Signatures with Partially Unknown MessagesLecture Notes in Computer Science, 2009
- Fault Attacks on RSA with CRT: Concrete Results and Practical CountermeasuresLecture Notes in Computer Science, 2003
- On the Importance of Eliminating Errors in Cryptographic ComputationsJournal of Cryptology, 2000
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)Lecture Notes in Computer Science, 1999
- Low cost attacks on tamper resistant devicesLecture Notes in Computer Science, 1998