Nested cover-free families for unbounded fault-tolerant aggregate signatures

DOI10.1016/j.tcs.2020.12.008zbMath1477.68098OpenAlexW3112089147MaRDI QIDQ2220866

Lucia Moura, Thais Bardini Idalino

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.008

zbMATH Keywords

fault-tolerancedigital signaturecombinatorial group testingaggregate signaturecover-free family

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Randomized algorithms (68W20) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Structure-aware combinatorial group testing: a new method for pandemic screening

Cites Work

• Unnamed Item
• Unnamed Item
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families
• Short signatures from the Weil pairing
• On \(r\)-cover-free families
• Modification tolerant signature schemes: location and correction
• Embedding cover-free families and cryptographical applications
• Locating modifications in signed data for partial data integrity
• Fault-Tolerant Aggregate Signatures
• Constructions of 2-cover-free families and related separating hash families
• Group Testing and Batch Verification
• Explicit Nonadaptive Combinatorial Group Testing Schemes

This page was built for publication: Nested cover-free families for unbounded fault-tolerant aggregate signatures