Sciweavers

1834 search results - page 35 / 367
» Public Key Cryptography
Sort
View
EUROPKI
2004
Springer
14 years 1 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...
FDTC
2006
Springer
120views Cryptology» more  FDTC 2006»
13 years 11 months ago
Blinded Fault Resistant Exponentiation
As the core operation of many public key cryptosystems, group exponentiation is central to cryptography. Attacks on its implementation in embedded device setting is hence of great ...
Guillaume Fumaroli, David Vigilant
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
14 years 1 months ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
WINET
2010
179views more  WINET 2010»
13 years 6 months ago
Achieving robust message authentication in sensor networks: a public-key based approach
Given the extremely limited hardware resources on sensor nodes and the inclement deploying environment, the adversary Denial-of-Service (DoS) attack becomes a serious security thre...
Haodong Wang, Qun Li
FDTC
2009
Springer
191views Cryptology» more  FDTC 2009»
14 years 2 months ago
Protecting RSA against Fault Attacks: The Embedding Method
—Fault attacks constitute a major threat toward cryptographic products supporting RSA-based technologies. Most often, the public exponent is unknown, turning resistance to fault ...
Marc Joye