Sciweavers

55 search results - page 5 / 11
» Design Validations for Discrete Logarithm Based Signature Sc...
Sort
View
MYCRYPT
2005
Springer
123views Cryptology» more  MYCRYPT 2005»
14 years 2 months ago
Optimization of the MOVA Undeniable Signature Scheme
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
Jean Monnerat, Yvonne Anne Oswald, Serge Vaudenay
PKC
1998
Springer
134views Cryptology» more  PKC 1998»
14 years 23 days ago
How (not) to Design RSA Signature Schemes
The concept of public-key cryptography was invented in 1976 by Diffie and Hellman [DH]. The following year, Rivest, Shamir and Adleman provided an implementation of this idea [RSA]...
Jean-François Misarsky
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 8 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
ICISC
2004
147views Cryptology» more  ICISC 2004»
13 years 10 months ago
Batch Verifications with ID-Based Signatures
An identity (ID)-based signature scheme allows any pair of users to verify each other's signatures without exchanging public key certificates. With the advent of Bilinear maps...
HyoJin Yoon, Jung Hee Cheon, Yongdae Kim
NDSS
2000
IEEE
14 years 29 days ago
Chameleon Signatures
Abstract. Chameleon signatures simultaneously provide the properties of nonrepudiation and non-transferability for the signed message. However, the initial constructions of chamele...
Hugo Krawczyk, Tal Rabin