Sciweavers

53 search results - page 7 / 11
» How to Hash into Elliptic Curves
Sort
View
IJNSEC
2008
115views more  IJNSEC 2008»
13 years 8 months ago
A Simple User Authentication Scheme for Grid Computing
The security issue has become an important concern of grid computing. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for us...
Rongxing Lu, Zhenfu Cao, Zhenchuan Chai, Xiaohui L...
SCN
2004
Springer
123views Communications» more  SCN 2004»
14 years 1 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
MOC
2000
87views more  MOC 2000»
13 years 8 months ago
Improving the parallelized Pollard lambda search on anomalous binary curves
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
Robert P. Gallant, Robert J. Lambert, Scott A. Van...
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
13 years 6 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
CTRSA
2012
Springer
273views Cryptology» more  CTRSA 2012»
12 years 4 months ago
On the Joint Security of Encryption and Signature in EMV
We provide an analysis of current and future algorithms for signature and encryption in the EMV standards in the case where a single key-pair is used for both signature and encrypt...
Jean Paul Degabriele, Anja Lehmann, Kenneth G. Pat...