2010
DOI: 10.1007/978-3-642-14496-7_12
|View full text |Cite
|
Sign up to set email alerts
|

Group Testing and Batch Verification

Abstract: We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new sequential and parallel algorithms for finding invalid signatures based on group testing algorithms. Of the five new algorithms, three show improved performance for many parameter choices, and the performance gains are especially notable when multiple processors are available.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 24 publications
(24 citation statements)
references
References 41 publications
0
24
0
Order By: Relevance
“…On the implementation of AutoBatch, future work could be more resilient to DoS and related attacks by implementing alternative techniques for recognizing invalid signatures in a batch, e.g., [42,50,51,69]. We are continuously on the lookout for more efficient means of computing in bilinear groups.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…On the implementation of AutoBatch, future work could be more resilient to DoS and related attacks by implementing alternative techniques for recognizing invalid signatures in a batch, e.g., [42,50,51,69]. We are continuously on the lookout for more efficient means of computing in bilinear groups.…”
Section: Resultsmentioning
confidence: 99%
“…Prior works considered the implication of invalid signatures in a batch, e.g., [28,42,50,51,69]. Mainly, these works estimated raw signature verification times under various conditions.…”
Section: Batch Verification In Practicementioning
confidence: 99%
“…Therefore, as the service provider has to check each item in the list, verification takes a (maximum) number of resources linear with the number of revoked credentials. Batch verification techniques try to tackle this [23]. Note that in some VLR schemes [33,21], all signatures made with the same credential become linkable after its revocation.…”
Section: Service Providermentioning
confidence: 99%
“…Aside from terminology, a "group testing" algorithm is precisely a forgery-identification algorithm built on top of batch verification; in particular, both [25] and [26] fit into this framework. However, the following papers (some of which predate [39]) do not fit into this framework.…”
Section: Introductionmentioning
confidence: 99%
“…Zaverucha and Stinson in [39] pointed out that there was already a long literature on the number of tests required by adaptive and non-adaptive "group testing" algorithms. Aside from terminology, a "group testing" algorithm is precisely a forgery-identification algorithm built on top of batch verification; in particular, both [25] and [26] fit into this framework.…”
Section: Introductionmentioning
confidence: 99%