Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Battaglioni, Massimo"'
We introduce and study a family of rate-compatible Low-Density Parity-Check (LDPC) codes characterized by very simple encoders. The design of these codes starts from simplex codes, which are defined by parity-check matrices having a straightforward f
Externí odkaz:
http://arxiv.org/abs/2309.14917
Digital data transfer can be protected by means of suitable error correcting codes. Among the families of state-of-the-art codes, LDPC (Low Density Parity-Check) codes have received a great deal of attention recently, because of their performance and
Externí odkaz:
http://arxiv.org/abs/2210.03537
The assessment of cyber risk plays a crucial role for cybersecurity management, and has become a compulsory task for certain types of companies and organizations. This makes the demand for reliable cyber risk assessment tools continuously increasing,
Externí odkaz:
http://arxiv.org/abs/2206.11586
In a blockchain Data Availability Attack (DAA), a malicious node publishes a block header but withholds part of the block, which contains invalid transactions. Honest full nodes, which can download and store the full blockchain, are aware that some d
Externí odkaz:
http://arxiv.org/abs/2202.07265
ASBK (named after the authors' initials) is a recent blockchain protocol tackling data availability attacks against light nodes, employing two-dimensional Reed-Solomon codes to encode the list of transactions and a random sampling phase where adversa
Externí odkaz:
http://arxiv.org/abs/2201.08261
Autor:
Baldi, Marco, Battaglioni, Massimo, Chiaraluce, Franco, Horlemann-Trautmann, Anna-Lena, Persichetti, Edoardo, Santini, Paolo, Weger, Violetta
In this paper we introduce a variant of the Syndrome Decoding Problem (SDP), that we call Restricted SDP (R-SDP), in which the entries of the searched vector are defined over a subset of the underlying finite field. We prove the NP-completeness of R-
Externí odkaz:
http://arxiv.org/abs/2008.06403
Autor:
Weger, Violetta, Khathuria, Karan, Horlemann, Anna-Lena, Battaglioni, Massimo, Santini, Paolo, Persichetti, Edoardo
In this paper we study the hardness of the syndrome decoding problem over finite rings endowed with the Lee metric. We first prove that the decisional version of the problem is NP-complete, by a reduction from the $3$-dimensional matching problem. Th
Externí odkaz:
http://arxiv.org/abs/2002.12785
Autor:
Weger, Violetta, Battaglioni, Massimo, Santini, Paolo, Chiaraluce, Franco, Baldi, Marco, Persichetti, Edoardo
Information set decoding (ISD) algorithms are the best known procedures to solve the decoding problem for general linear codes. These algorithms are hence used for codes without a visible structure, or for which efficient decoders exploiting the code
Externí odkaz:
http://arxiv.org/abs/2001.08425
Iterative decoders used for decoding low-density parity-check (LDPC) and moderate-density parity-check (MDPC) codes are not characterized by a deterministic decoding radius and their error rate performance is usually assessed through intensive Monte
Externí odkaz:
http://arxiv.org/abs/1910.00472
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes. We show that the feasibility of these a
Externí odkaz:
http://arxiv.org/abs/1904.12215