248 search results - page 19 / 50 » Fault Attacks on Signature Schemes |
109
click to vote
IMA
2005
Springer
15 years 7 months ago
2005
Springer
In recent years much research has been devoted to producing formal models of security for cryptographic primitives and to designing schemes that can be proved secure in such models...
127
click to vote
CCS
1999
ACM
15 years 6 months ago
1999
ACM
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
160
click to vote
PKC
2000
Springer
15 years 5 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
105
Voted
JSAC
2010
15 years 10 days ago
2010
Abstract—Random linear network coding can be used in peerto-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are ...
97
Voted
PKC
2009
Springer
16 years 2 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...