Group testing and batch verification

Authors:
Gregory M. Zaverucha;Douglas R. Stinson
Affiliations:
David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada;David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, ON, Canada
Venue:
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Year:
2009

Citing 25
Cited 5

The complexity of parallel search

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Key storage in secure networks

Discrete Applied Mathematics
On the upper bound of the size of the r-cover-free families

Journal of Combinatorial Theory Series A
A new competitive algorithm for group testing

Discrete Applied Mathematics
Some new bounds for cover-free families

Journal of Combinatorial Theory Series A
Long-Lived Broadcast Encryption

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Batch RSA

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Codes Identifying Bad Signature in Batches

INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Authentication of Concast Communication

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Attacking and Repairing Batch Verification Schemes

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Identification of Bad Signatures in Batches

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
An Identity-Based Signature from Gap Diffie-Hellman Groups

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels

Theoretical Computer Science
Attack on a concast signature scheme

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Short Signatures from the Weil Pairing

Journal of Cryptology
How to win the clonewars: efficient periodic n-times anonymous authentication

Proceedings of the 13th ACM conference on Computer and communications security
Batch Verification of Short Signatures

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Explicit Non-adaptive Combinatorial Group Testing Schemes

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures

Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Practical Short Signature Batch Verification

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A signature scheme with efficient protocols

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Finding invalid signatures in pairing-based batches

Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Trading time for space: towards an efficient IBE scheme with short(er) public parameters in the standard model

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Combinatorial properties of frameproof and traceability codes

IEEE Transactions on Information Theory

Identification of multiple invalid pairing-based signatures in constrained batches

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
On batch verification with group testing for vehicular communications

Wireless Networks
Analysis of revocation strategies for anonymous Idemix credentials

CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Energy efficient authentication strategies for network coding

Concurrency and Computation: Practice & Experience
Machine-generated algorithms, proofs and software for the batch verification of digital signature schemes

Proceedings of the 2012 ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

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 survey relevant group testing techniques, and 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.