1998
DOI: 10.1049/el:19980620
|View full text |Cite
|
Sign up to set email alerts
|

Batch verifying multiple DSA-type digital signatures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0
1

Year Published

2000
2000
2018
2018

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 44 publications
(22 citation statements)
references
References 4 publications
0
21
0
1
Order By: Relevance
“…However, it increases the authentication time due to large modular exponential and multiplication computations. Further, Harn [81] proposed another multiple DSA-type signature scheme. However, it does not always produce the true results when it groups the same base terms together and adds the exponent terms together.…”
Section: Digital Signature Algorithm (Dsa)-based Protocolsmentioning
confidence: 99%
“…However, it increases the authentication time due to large modular exponential and multiplication computations. Further, Harn [81] proposed another multiple DSA-type signature scheme. However, it does not always produce the true results when it groups the same base terms together and adds the exponent terms together.…”
Section: Digital Signature Algorithm (Dsa)-based Protocolsmentioning
confidence: 99%
“…In 1995, Laih and Yen proposed a new method for batch verification of DSA and RSA signatures [41], but the RSA batch verifier was broken five years later by Boyd and Pavlovski [17]. In 1998, two batch verification techniques were presented for DSA and RSA [32,33] but both were later broken [17,38,39]. The same year, Bellare, Garay and Rabin took the first systematic look at batch verification [11] and presented three generic methods for batching modular exponentiations, one of which is called the small exponents test.…”
Section: Related Workmentioning
confidence: 99%
“…Однак, Lim і Lee зазначили [2], що в цій схемі цифровий муль-типідпис може бути легко підроблений, для того щоб пройти групову перевірку чинності. У 1998 році Harn запропонував два методи групової перевірки чинності цифрового мультипідпису [3,4]. Разом з тим, Hwang та ін.…”
Section: постановка задачіunclassified