Sciweavers

1769 search results - page 188 / 354
» Cryptography
Sort
View
128
Voted
CHES
2004
Springer
136views Cryptology» more  CHES 2004»
15 years 9 months ago
Attacking DSA Under a Repeated Bits Assumption
We discuss how to recover the private key for DSA style signature schemes if partial information about the ephemeral keys is revealed. The partial information we examine is of a se...
Peter J. Leadbitter, Dan Page, Nigel P. Smart
121
Voted
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
15 years 9 months ago
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
Pradeep Kumar Mishra
124
Voted
CHES
2004
Springer
130views Cryptology» more  CHES 2004»
15 years 9 months ago
Switching Blindings with a View Towards IDEA
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...
Olaf Neiße, Jürgen Pulkus
131
Voted
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
15 years 9 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
132
Voted
EUROCRYPT
2004
Springer
15 years 9 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen