On the Importance of Checking Computations (0) [14 citations — 0 self]
by
Dan Boneh
,
Richard A. Demillo
,
Richard J. Lipton
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Boneh_onthe,
author = {Dan Boneh and Richard A. Demillo and Richard J. Lipton},
title = {On the Importance of Checking Computations},
year = {}
}
author = {Dan Boneh and Richard A. Demillo and Richard J. Lipton},
title = {On the Importance of Checking Computations},
year = {}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We present a theoretical model for breaking various cryptographic schemes by taking advantage of random hardware faults. We show how to attack certain implementations of RSA and Rabin signatures. We also show how various authentication protocols, such as Fiat-Shamir and Schnorr, can be broken using hardware faults. 1
Citations
| 412 | Efficient signature generation by smart cards – Schnorr - 1991 |
| 249 | Zero-knowledge proofs of identity – Feige, Fiat, et al. - 1988 |
| 238 | The Exact Security of Digital Signatures: How to sign with RSA and Rabin – Bellare, Rogaway - 1996 |
| 216 | Digital signatures and Public-key Functions as Factorization – Rabin - 1979 |
| 211 | Timing attacks on implementations of Diffie-Hellman – Kocher |
| 18 | Memo on RSA Signature Generation in the Presence of Faults – Lenstra - 1996 |
| 10 | Witness Based Cryptographic Program Checking and Robust Function Sharing – Frankel, Gemmel, et al. - 1996 |
| 1 | Program result checking", proc – Blum, Wasserman |
