Andrea Flamini

Andrea Flamini

Auto-generated profile, based on publicly available information

Andrea Flamini

Hasso Plattner Institute, University of Potsdam, Potsdam, Germany

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 May 2024 in Journal of Information Security and Applications
Verified
Journal Article
Open access
AFAndrea Flamini
Andrea Flamini
GSGiada Sciarretta
Giada Sciarretta
MSMario Scuro
Mario Scuro
ASAmir Sharif
Amir Sharif
ATAlessandro Tomasi
Alessandro Tomasi
SRSilvio Ranise
Silvio Ranise


18 December 2023
Verified
Book Chapter
Closed access
PDF file
GDGiuseppe D’aLconzo
Giuseppe D’aLconzo
AFAndrea Flamini
Andrea Flamini
AGAndrea Gangemi
Andrea Gangemi

29 March 2022 in Applicable Algebra in Engineering, Communication and Computing
Verified
Journal Article
Open access
PDF file
AFAndrea Flamini
Andrea Flamini
RLRiccardo Longo
Riccardo Longo
AMAlessio Meneghetti
Alessio Meneghetti
In this paper we present the Multidimensional Byzantine Agreement (MBA) Protocol, a leaderless Byzantine agreement protocol defined for complete and synchronous networks that allows a network of nodes to reach consensus on a vector of relevant information regarding a set of observed events. The consensus process is carried out in parallel on each component, and the output is a vector whose components are either values with wide agreement in the network (even if no individual node agrees on every value) or a special value \(\bot \) that signals irreconcilable disagreement. The MBA Protocol is probabilistic and its execution halts with probability 1, and the number of steps necessary to halt follows a Bernoulli-like distribution. The design combines a Multidimensional Graded Consensus and a Multidimensional Binary Byzantine Agreement, the generalization to the multidimensional case of two protocols presented by Micali et al. (SIAM J Comput 26(4):873–933, 1997; Byzantine agreement, made trivial, 2016). We prove the correctness and security of the protocol assuming a synchronous network where less than a third of the nodes are malicious.

1 April 2022 in arXiv
Verified
Preprint
Open access
PDF file
AFAndrea Flamini
Andrea Flamini
RLRiccardo Longo
Riccardo Longo
AMAlessio Meneghetti
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 allows a network of nodes to reach consensus on a vector of relevant information regarding a set of observed events. The consensus process is carried out in parallel on each component, and the output is a vector whose components are either values with wide agreement in the network (even if no individual node agrees on every value) or a special value $\bot$ that signals irreconcilable disagreement. The MBA Protocol is probabilistic and its execution halts with probability 1, and the number of steps necessary to halt follows a Bernoulli-like distribution. The design combines a Multidimensional Graded Consensus and a Multidimensional Binary Byzantine Agreement, the generalization to the multidimensional case of two protocols by Micali and Feldman. We prove the correctness and security of the protocol assuming a synchronous network where less than a third of the nodes are malicious.

13 May 2022 in arXiv
Verified
Preprint
Open access
PDF file
AFAndrea Flamini
Andrea Flamini
RLRiccardo Longo
Riccardo Longo
AMAlessio Meneghetti
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 carries out the consensus process in parallel on each component of a list of events to be observed and recorded. We show how Cob can be used to define a consensus layer for scalable and sustainable blockchains. This layer is used to design consensus protocols based on sharding as a mean to achieve scalability, and on the fragmentation of time in time-slots (which get assigned to nodes that are instructed to create new blocks) as a mean to reduce the amount of computation and communication necessary for the maintenance of the distributed ledger. We explain why Cob is a viable candidate to implement such consensus layer through the introduction of an auxiliary blockchain that we name Synchronization Chain.