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

DOI10.1007/978-3-319-94667-2_5MaRDI QIDQ1670983zbMATH OpenOpenAlexFDO

Authors 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

aggregate signaturecombinatorial group testingcover-free familydigital signaturefault-tolerance

Mathematics Subject Classification ID

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

Recommendations

• Nested cover-free families for unbounded fault-tolerant aggregate signatures
• Fault-tolerant aggregate signatures
• Unrestricted and compact certificateless aggregate signature scheme
• An efficient certificateless aggregate signature with constant pairing computations
• On the security of some aggregate signature schemes
• Novel efficient certificateless aggregate signatures
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
• Certificateless aggregate signature scheme secure against fully chosen-key attacks
• Insecurity of an efficient certificateless aggregate signature with constant pairing computations

Cited in

(4)

• Structure-aware combinatorial group testing: a new method for pandemic screening
• Nested cover-free families for unbounded fault-tolerant aggregate signatures
• Fault-tolerant aggregate signatures
• A survey of cover-free families: constructions, applications, and generalizations

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

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