Embedding cover-free families and cryptographical applications

@article{Idalino2019EmbeddingCF,
  title={Embedding cover-free families and cryptographical applications},
  author={Tha{\'i}s Bardini Idalino and Lucia Moura},
  journal={Adv. Math. Commun.},
  year={2019},
  volume={13},
  pages={629-643}
}
Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$). We are specially interested in cryptographic problems, and we note that some of these problems need cover-free families with an increasing size $n$. Solutions that propose the increase of $n$, such as \emph{monotone families} and \emph{nested families}, have… Expand
Nested cover-free families for unbounded fault-tolerant aggregate signatures
TLDR
This paper proposes efficient solutions for the unbounded scheme, relying on sequences of d-cover-free families that the authors call nested families, and proposes the use of ( d, λ ) -cover- free families to support the loss of up to λ − 1 parts of the aggregate. Expand
Fault Tolerance in Cryptographic Applications Using Cover-Free Families
TLDR
This thesis proposes solutions to provide fault tolerance to certain cryptographic problems that traditionally have an all-or-nothing outcome, and explores techniques of identification of defective elements used in nonadaptive combinatorial group testing. Expand

References

SHOWING 1-10 OF 24 REFERENCES
Families of finite sets in which no set is covered by the union ofr others
AbstractLetfr(n, k) denote the maximum number ofk-subsets of ann-set satisfying the condition in the title. It is proved that $$f_1 (n,r(t - 1) + 1 +Expand
New constructions for perfect hash families and related structures using combinatorial designs and codes
In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonalExpand
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families
TLDR
A solution to the unbounded scheme with increasing compression ratio for every d is proposed, and for \(d=1\) the compression ratio is the best possible and meets the information theoretical bound. Expand
Constructions of 2-cover-free families and related separating hash families
Cover-free families (CFF) were considered from dierent subjects by numerous researchers. In this paper we mainly consider explicit constructions of (2;d)-cover-free families. We also determine theExpand
Generalized cover-free families
TLDR
This paper introduces a generalization of cover-free families which includes as special cases all of the previously used definitions, and gives several bounds and some efficient constructions for these generalized cover- free families. Expand
Efficient Methods for Integrating Traceability and Broadcast Encryption
TLDR
A method forAdding any desired level of broadcasting capability to any traceability scheme and a method for adding any desiredlevel of traceability to any broadcast encryption scheme are presented. Expand
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
TLDR
This paper constructs an efficient aggregate signature from a recent short signature scheme based on bilinear maps due to Boneh, Lynn, and Shacham, and shows that aggregate signatures give rise to verifiably encrypted signatures. Expand
Packing arrays
TLDR
The consideration of a set of disjoint rows in a packing array which allows direct and recursive constructions and upper bounds on the sizes of packing arrays are introduced and a new upper bound on the size of all packing arrays is given. Expand
Fault-Tolerant Aggregate Signatures
TLDR
The notion of fault-tolerant aggregate signature schemes, in which the verification algorithm is able to determine the subset of all messages belonging to an aggregate that were signed correctly, provided that the number of aggregated faulty signatures does not exceed a certain bound is introduced. Expand
New Results on Multi-Receiver Authentication Codes
TLDR
This paper generalizes a polynomial construction due to Desmedt, Frankel and Yung, to allow multiple messages be authenticated with each key, and proposes a new flexible construction for multi-receiver A- code by combining an A-code and an (n, m, k)-cover-free family. Expand
...
1
2
3
...