Combinatorial Group Testing for Corruption Localizing Hashing

DOI10.1007/978-3-642-22685-4_50MaRDI QIDQ3087984zbMATH OpenOpenAlexFDO

Authors Annalisa De Bonis, Giovanni Di Crescenzo

Publication date 17 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22685-4_50

zbMATH Keywords

algorithmscryptographygroup testingsuperimposed codes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• scientific article; zbMATH DE number 823957
• An efficient algorithm for combinatorial group testing
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Algorithms and Data Structures
• Sparse Combinatorial Group Testing
• Explicit Nonadaptive Combinatorial Group Testing Schemes
• Improved Combinatorial Group Testing Algorithms for Real‐World Problem Sizes
• Combinatorial group testing in bipartite graphs

Cited in

(4)

• Symmetric-key corruption detection: when XOR-MACs meet combinatorial group testing
• Modification tolerant signature schemes: location and correction
• Strict group testing and the set basis problem
• Two new perspectives on multi-stage group testing

This page was built for publication: Combinatorial Group Testing for Corruption Localizing Hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087984)