Sciweavers

144 search results - page 1 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
201
Voted
AINA
2003
IEEE
15 years 10 months ago
Signature Schemes Based on Two Hard Problems Simultaneously
In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
Ching-Te Wang, Chu-Hsing Lin, Chin-Chen Chang
CSJM
2008
86views more  CSJM 2008»
15 years 7 months ago
Digital Signature Scheme Based on a New Hard Problem
Nikolay A. Moldovyan
PKC
2001
Springer
116views Cryptology» more  PKC 2001»
15 years 11 months ago
Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
Hongjun Wu, Feng Bao, Robert H. Deng
EUROCRYPT
2001
Springer
15 years 11 months ago
NSS: An NTRU Lattice-Based Signature Scheme
A new authentication and digital signature scheme called the NTRU Signature Scheme (NSS) is introduced. NSS provides an authentication/signature method complementary to the NTRU pu...
Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverma...
CJ
2006
100views more  CJ 2006»
15 years 7 months ago
Deterministic Identity-Based Signatures for Partial Aggregation
Aggregate signatures are a useful primitive which allows to aggregate into a single and constant-length signature many signatures on different messages computed by different users...
Javier Herranz