Efficient unbounded fault-tolerant aggregate signatures using nested cover-free families

DOI10.1007/978-3-319-94667-2_5OpenAlexW2809889031MaRDI QIDQ1670983

Thais Bardini Idalino, Lucia Moura

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94667-2_5

zbMATH Keywords

fault-tolerancedigital signaturecombinatorial group testingaggregate signaturecover-free family

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Structure-aware combinatorial group testing: a new method for pandemic screening ⋮ Nested cover-free families for unbounded fault-tolerant aggregate signatures

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