12 citations · 41 across the 8 of their papers we have counts for
9 papers
Bounds on Covering Codes in RT spaces using Ordered Covering Arrays
André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura +2
In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving o…
Locating modifications in signed data for partial data integrity
Thaís Bardini Idalino, Lucia Moura, Ricardo Felipe Custódio +1
We consider the problem of detecting and locating modifications in signed data to ensure partial data integrity. We assume that the data is divided into blocks (not necessarily…
Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces
André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura +2
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product…
Modification tolerant signature schemes: location and correction
Thais Bardini Idalino, Lucia Moura, Carlisle Adams
This paper considers malleable digital signatures, for situations where data is modified after it is signed. They can be used in applications where either the data can be modified…
Nested Cover-Free Families for Unbounded Fault-Tolerant Aggregate Signatures
Thais Bardini Idalino, Lucia Moura
Aggregate signatures are used to create one short proof of authenticity and integrity from a set of digital signatures. However, one invalid signature in the set invalidates the en…
Ordered Orthogonal Array Construction Using LFSR Sequences
André Guerino Castoldi, Lucia Moura, Daniel Panario +1
We present a new construction of ordered orthogonal arrays (OOA) of strength with columns over a finite field using linear feedback shift register s…
Structure-aware combinatorial group testing: a new method for pandemic screening
Thais Bardini Idalino, Lucia Moura
Combinatorial group testing (CGT) is used to identify defective items from a set of items by grouping them together and performing a small number of tests on the groups. Recently,…
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
Lucia Moura, Sebastian Raaphorst, Brett Stevens
Covering arrays are generalizations of orthogonal arrays that have been widely studied and are used in software testing. The probabilistic method has been employed to derive upper…
Embedding cover-free families and cryptographical applications
Thais Bardini Idalino, Lucia Moura
Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with elements and want to identify invalid…