Sciweavers

10 search results - page 1 / 2
» Two-Party Generation of DSA Signatures
Sort
View
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Two-Party Generation of DSA Signatures
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
Philip D. MacKenzie, Michael K. Reiter
NDSS
2003
IEEE
13 years 10 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two partiesā€”the client and the serverā...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
DCC
2003
IEEE
14 years 4 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
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...
Phong Q. Nguyen, Igor Shparlinski
PKC
2005
Springer
102views Cryptology» more  PKC 2005»
13 years 10 months ago
Experimenting with Faults, Lattices and the DSA
We present an attack on DSA smart-cards which combines physical fault injection and lattice reduction techniques. This seems to be the ļ¬rst (publicly reported) physical experimen...
David Naccache, Phong Q. Nguyen, Michael Tunstall,...
JOC
2002
99views more  JOC 2002»
13 years 4 months ago
The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
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 ...
Phong Q. Nguyen, Igor Shparlinski