Embedding cover-free families and cryptographical applications

DOI10.3934/amc.2019039zbMath1419.05040arXiv1811.00126OpenAlexW2952497181WikidataQ127632280 ScholiaQ127632280MaRDI QIDQ2274240

Lucia Moura, Thais Bardini Idalino

Publication date: 19 September 2019

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.00126

zbMATH Keywords

separating hash familycombinatorial group testingpolynomial over finite fieldcover-free familycombinatorial cryptographyembedding cover-free family

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Fault detection; testing in circuits and networks (94C12) Enumerative combinatorics (05A99) Combinatorial aspects of packing and covering (05B40)

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: Embedding cover-free families and cryptographical applications