2 citations · 3 across the 7 of their papers we have counts for
14 papers
SPANSE: combining sparsity with density for efficient one-time code-based digital signatures
Marco Baldi, Franco Chiaraluce, Paolo Santini
The use of codes defined by sparse characteristic matrices, like QC-LDPC and QC-MDPC codes, has become an established solution to design secure and efficient code-based public-key…
Analysis of a blockchain protocol based on LDPC codes
Massimo Battaglioni, Paolo Santini, Giulia Rafaiani +2
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, w…
Optimization of a Reed-Solomon code-based protocol against blockchain data availability attacks
Paolo Santini, Giulia Rafaiani, Massimo Battaglioni +2
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 enc…
Cryptanalysis of a code-based full-time signature
Nicolas Aragon, Marco Baldi, Jean-Christophe Deneuville +3
We present an attack against a code-based signature scheme based on the Lyubashevsky protocol that was recently proposed by Song, Huang, Mu, Wu and Wang (SHMWW). The private key in…
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors
Marco Baldi, Massimo Battaglioni, Franco Chiaraluce +4
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 sub…
Information set decoding of Lee-metric codes over finite rings
Violetta Weger, Massimo Battaglioni, Paolo Santini +3
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…