211 search results - page 27 / 43 » PSS Is Secure against Random Fault Attacks |
112
Voted
ACNS
2008
Springer
15 years 8 months ago
2008
Springer
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
129
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
114
click to vote
EUROCRYPT
2009
Springer
16 years 2 months ago
2009
Springer
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
FDTC
2006
Springer
15 years 5 months ago
2006
Springer
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
143
click to vote
CCS
2005
ACM
15 years 7 months ago
2005
ACM
Cyber attacks against networked computers have become relentless in recent years. The most common attack method is to exploit memory corruption vulnerabilities such as buffer ove...