Sciweavers

79 search results - page 12 / 16
» Cryptosystems Based on Elliptic Curve Pairing
Sort
View
IJNSEC
2007
130views more  IJNSEC 2007»
13 years 7 months ago
An Attack on Libert et al.' s ID-based Undeniable Signature Scheme
In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this article, we show that the scheme is not secure. ...
Zichen Li, C. F. Chong, Lucas Chi Kwong Hui, Siu-M...
ANTS
2006
Springer
101views Algorithms» more  ANTS 2006»
13 years 11 months ago
High Security Pairing-Based Cryptography Revisited
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...
Robert Granger, Dan Page, Nigel P. Smart
EUROCRYPT
1999
Springer
13 years 11 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
AINA
2007
IEEE
14 years 1 months ago
An Efficient Scheme for User Authentication in Wireless Sensor Networks
This paper presents a distributed user authentication scheme in wireless sensor networks. Our scheme is based on the self-certified keys cryptosystem (SCK), and we have modified i...
Canming Jiang, Bao Li, Haixia Xu
IJNSEC
2008
115views more  IJNSEC 2008»
13 years 7 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...