Sciweavers

153 search results - page 7 / 31
» Efficient lattice-based signature scheme
Sort
View
IJNSEC
2010
143views more  IJNSEC 2010»
13 years 2 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
IJACT
2008
158views more  IJACT 2008»
13 years 7 months ago
Efficient lattice-based signature scheme
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...
IJACT
2008
64views more  IJACT 2008»
13 years 7 months ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong
ASIACRYPT
2006
Springer
13 years 11 months ago
New Approach for Selectively Convertible Undeniable Signature Schemes
In this paper, we propose a new approach for constructing selectively convertible undeniable signature schemes, and present two efficient schemes based on RSA. Our approach allows ...
Kaoru Kurosawa, Tsuyoshi Takagi
AINA
2004
IEEE
13 years 11 months ago
An Identity-based Ring Signature Scheme from Bilinear Pairings
At the conference Asiacrypt 2001, Rivest, Shamir and Tauman firstly addressed the concept of ring signature. In this paper we propose an identity-based ring signature scheme from ...
Chih-Yin Lin, Tzong-Chen Wu