Zobrazeno 1 - 10
of 179
pro vyhledávání: '"Moura, Lucia"'
Publikováno v:
Information Processing Letters 115 (2015) 731-737
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 $n$ blocks (not necessarily of the same size) and that a threshold $d$ is given for the maximum a
Externí odkaz:
http://arxiv.org/abs/2208.01411
Autor:
Castoldi, André Guerino, Carmelo, Emerson L. Monte, Moura, Lucia, Panario, Daniel, Stevens, Brett
This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also obtained by im
Externí odkaz:
http://arxiv.org/abs/2208.01410
Publikováno v:
In: Progress in Cryptology - INDOCRYPT 2019. Lecture Notes in Computer Science, vol 11898. Springer, Cham (2019)
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 (collaborative work), or the data must be modified (redactable and con
Externí odkaz:
http://arxiv.org/abs/2208.00373
Autor:
Idalino, Thais Bardini, Moura, Lucia
Publikováno v:
Theoretical Computer Science 854 (2021) 116-130
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 entire aggregate, giving no information on which signatures are valid. H
Externí odkaz:
http://arxiv.org/abs/2208.00371
Autor:
Castoldi, André Guerino, Carmelo, Emerson Luiz do Monte, Moura, Lucia, Panario, Daniel, Stevens, Brett
Publikováno v:
CAI 2019. Lecture Notes in Computer Science, vol 11545. Springer
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 or extending some previous results.
Comment: 12 pages
Comment: 12 pages
Externí odkaz:
http://arxiv.org/abs/2208.01412
Publikováno v:
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 63, NO. 2, FEBRUARY 2017
We present a new construction of ordered orthogonal arrays (OOA) of strength $t$ with $(q + 1)t$ columns over a finite field $\mathbb{F}_{q}$ using linear feedback shift register sequences (LFSRs). OOAs are naturally related to $(t, m, s)$-nets, line
Externí odkaz:
http://arxiv.org/abs/2208.00333
Autor:
Idalino, Thais Bardini, Moura, Lucia
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, group testing has been used to design efficient COVID-19 testing, so t
Externí odkaz:
http://arxiv.org/abs/2202.09264
Autor:
Silva, Mateus Torres, Costa, Lara Carvalho, Moura, Marcoeli Silva, Lima, Cacilda Castelo Branco, Almeida de Deus Moura, Lúcia de Fátima, Martins-Júnior, Paulo Antônio, Lima, Marina de Deus Moura
Publikováno v:
In Journal of Endodontics December 2023 49(12):1595-1604
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 bounds on the sizes of minimum covering arrays and give asymptotic upp
Externí odkaz:
http://arxiv.org/abs/1901.05386
Autor:
dos Anjos, Angela Maria Cardoso, Moura de Lima, Marina de Deus, Muniz, Francisco Wilker Mustafa Gomes, Lima, Cacilda Castelo Branco, Moura, Lúcia de Fátima Almeida de Deus, Rösing, Cassiano Kuchenbecker, de Moura, Marcoeli Silva
Publikováno v:
In Journal of Dentistry June 2023