Sciweavers

155 search results - page 18 / 31
» Hash Based Digital Signature Schemes
Sort
View
IJACT
2008
158views more  IJACT 2008»
14 years 11 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...
PKC
2010
Springer
150views Cryptology» more  PKC 2010»
15 years 3 months ago
Security of Encryption Schemes in Weakened Random Oracle Models
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, K...
SCN
2010
Springer
176views Communications» more  SCN 2010»
14 years 10 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
INFORMATICALT
2007
100views more  INFORMATICALT 2007»
14 years 11 months ago
On the Proxy-Protected Property of Chen et al.'s Proxy Multisignature Schemes
Recently, Chen, Chung, and Huang proposed a traceable proxy multisignature scheme based on the elliptic curve cryptosystem. However, this paper shows that the original signers can ...
Pei-Hui Huang, Hsiang-An Wen, Chih-Hung Wang, Tzon...
ACNS
2009
Springer
121views Cryptology» more  ACNS 2009»
15 years 3 months ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicio...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay