5 citations · 27 across the 21 of their papers we have counts for
22 papers
The weight distribution of codes over finite chain rings
Giulia Cavicchioni, Alessio Meneghetti
In this work, we determine new linear equations for the weight distribution of linear codes over finite chain rings. The identities are determined by counting the number of some sp…
Cob: a consensus layer enabling sustainable sharding-based consensus protocols
Andrea Flamini, Riccardo Longo, Alessio Meneghetti
In this paper we explore a context of application of Cob, a recently introduced Byzantine Fault Tolerant consensus protocol. Cob proves to be a leaderless consensus protocol which…
Security issues of CFS-like digital signature algorithms
Giuseppe D'Alconzo, Alessio Meneghetti, Paolo Piasenti
We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS…
On the equivalence of two post-quantum cryptographic families
Alessio Meneghetti, Alex Pellegrini, Massimiliano Sala
The Maximum Likelihood Decoding Problem (MLD) is known to be NP-hard and its complexity is strictly related to the security of some post-quantum cryptosystems, that is, the so-call…
Cob: a Leaderless Protocol for Parallel Byzantine Agreement in Incomplete Networks
Andrea Flamini, Riccardo Longo, Alessio Meneghetti
In this paper we extend the \emph{Multidimensional Byzantine Agreement (MBA) Protocol}, a {leaderless} Byzantine agreement for lists of arbitrary values, into a protocol suitable f…
A survey on NIST PQ signatures
Nicola Di Chiano, Riccardo Longo, Alessio Meneghetti +1
Shor's shockingly fast quantum algorithm for solving the period-finding problem is a threat for the most common public-key primitives, as it can be efficiently applied to solve bot…
Multidimensional Byzantine Agreement in a Synchronous Setting
Andrea Flamini, Riccardo Longo, Alessio Meneghetti
In this paper we will present the Multidimensional Byzantine Agreement (MBA) Protocol, a leaderless Byzantine agreement protocol defined for complete and synchronous networks that…
A Provably-Unforgeable Threshold EdDSA with an Offline Recovery Party
Michele Battagliola, Riccardo Longo, Alessio Meneghetti +1
A -threshold signature scheme enables distributed signing among players such that any subset of size at least can sign, whereas any subset with fewer players cannot.…
Threshold ECDSA with an Offline Recovery Party
Michele Battagliola, Riccardo Longo, Alessio Meneghetti +1
A threshold signature scheme enables distributed signing among players such that any subgroup of size can sign, whereas any group with fewer players cannot. Our go…
Characterisation of the parameters of maximum weight spectrum codes according to their spread
Alessio Meneghetti, Wrya K. Kadir
We introduce the concept of spread of a code, and we specialize it to the case of maximum weight spectrum (MWS) codes. We classify two newly-defined sub-families of MWS codes accor…
A formula on the weight distribution of linear codes with applications to AMDS codes
Alessio Meneghetti, Marco Pellegrini, Massimiliano Sala
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight en…
A new ECDLP-based PoW model
Alessio Meneghetti, Massimiliano Sala, Daniele Taufer
We lay the foundations for a blockchain scheme, whose consensus is reached via a proof of work algorithm based on the solution of consecutive discrete logarithm problems over the p…
A survey on efficient parallelization of blockchain-based smart contracts
Alessio Meneghetti, Tommaso Parise, Massimiliano Sala +1
The main problem faced by smart contract platforms is the amount of time and computational power required to reach consensus. In a classical blockchain model, each operation is in…
Two-tier blockchain timestamped notarization with incremental security
Alessio Meneghetti, Armanda Ottaviano Quintavalle, Massimiliano Sala +1
Digital notarization is one of the most promising services offered by modern blockchain-based solutions. We present a digital notary design with incremental security and cost reduc…
Binary linear code weight distribution estimation by random bit stream compression
Alessandro Tomasi, Alessio Meneghetti
A statistical estimation algorithm of the weight distribution of a linear code is shown, based on using its generator matrix as a compression function on random bit strings.
On linear codes and distinct weights
Alessio Meneghetti
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existen…
Type-Preserving Matrices and Security of Block Ciphers
Riccardo Aragona, Alessio Meneghetti
We provide a new property, called Non-Type-Preserving, for a mixing layer which guarantees protection against algebraic attacks based on the imprimitivity of the group generated by…
Vanishing ideals of binary Hamming spheres
Giuseppe D'Alconzo, Alessio Meneghetti
We consider the simplified Algebraic Normal Form (sANF) of Boolean functions vanishing on Hamming spheres centred at zero and the associated sANF vector. We show that this vector i…
On optimal nonlinear systematic codes
Eleonora Guerrini, Alessio Meneghetti, Massimiliano Sala
Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily…
Code generator matrices as RNG conditioners
Alessandro Tomasi, Alessio Meneghetti, Massimiliano Sala
We quantify precisely the distribution of the output of a binary random number generator (RNG) after conditioning with a binary linear code generator matrix by showing the connecti…
On the Griesmer bound for nonlinear codes
Emanuele Bellini, Eleonora Guerrini, Alessio Meneghetti +1
Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family…
A weight-distribution bound for entropy extractors using linear binary codes
Alessio Meneghetti, Massimiliano Sala, Alessandro Tomasi
We consider a bound on the bias reduction of a random number generator by processing based on binary linear codes. We introduce a new bound on the total variation distance of the p…