985 search results - page 29 / 197 » On the validity of digital signatures |
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
CHES
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We describe an implementation of the PASS polynomial authentication and signature scheme [5, 6] that is suitable for use in highly constrained environments such as SmartC...
DCC
2003
IEEE
14 years 8 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
JOC
2002
13 years 8 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
SP
2009
IEEE
14 years 3 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...