Giovanni Farina

Dr. Giovanni Farina

University Niccolò Cusano, Rome, Lazio, Italy
orcid

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
29 May 2025 in Sensors
Verified
Journal Article
Open access
PDF file
Giovanni FarinaGiovanni Farina
Giovanni Farina
Alexander KocianAlexander Kocian
Alexander Kocian
Gianluca BrunoriGianluca Brunori
Gianluca Brunori
Stefano ChessaStefano Chessa
Stefano Chessa
MLMaria Bonaria Lai
Maria Bonaria Lai
LMLucio Moreschi
Lucio Moreschi
Traceability plays a critical role in ensuring the quality, safety, and transparency of supply chains, where transportation stakeholders are fundamental to the efficient movement of goods. However, the diversity of actors involved poses significant challenges to achieving these goals. Each organization typically operates its own information system, tailored to manage internal data, but often lacks the ability to communicate effectively with external systems. Moreover, when data exchange between different systems is required, it becomes critical to maintain full control over the shared data and to manage access rights precisely. In this work, we propose the concept of interoperable traceability. We present a model that enables the seamless integration of data from sensors, IoT devices, data management platforms, and distributed ledger technologies (DLT) within a newly designed data space architecture. We also demonstrate a practical implementation of this concept by applying it to real-world scenarios in the agri-food sector, with direct implications for transportation systems and all stakeholders in a supply chain. Our demonstrator supports the secure exchange of traceability data between existing systems, providing stakeholders with a novel approach to managing and auditing data with increased transparency and efficiency.

1 July 2021
Verified
Conference Paper
Closed access
SBSilvia Bonomi
Silvia Bonomi
JDJeremie Decouchant
Jeremie Decouchant
Giovanni FarinaGiovanni Farina
Giovanni Farina
VRVincent Rahli
Vincent Rahli
STSebastien Tixeuil
Sebastien Tixeuil
In this paper, we consider the Byzantine reliable broadcast problem on authenticated and partially connected networks. The state-of-the-art method to solve this problem consists in combining two algorithms from the literature. Handling asynchrony and faulty senders is typically done thanks to Gabriel Bracha's authenticated double-echo broadcast protocol, which assumes an asynchronous fully connected network. Danny Dolev's algorithm can then be used to provide reliable communications between processes in the global fault model, where up to f processes among N can be faulty in a communication network that is at least 2f+1-connected. Following recent works that showed how Dolev's protocol can be made more practical thanks to several optimizations, we show that the state-of-the-art methods to solve our problem can be optimized thanks to layer-specific and cross-layer optimizations. Our simulations with the Omnet++ network simulator show that these optimizations can be efficiently combined to decrease the total amount of information transmitted or the protocol's latency (e.g., respectively, −25% and −50% with a 16B payload, N=31 and f=4) compared to the state-of-the-art combination of Bracha's and Dolev's protocols.

7 September 2019 in Journal of the Brazilian Computer Society
Verified
Journal Article
Open access
PDF file
SBSilvia Bonomi
Silvia Bonomi
Giovanni FarinaGiovanni Farina
Giovanni Farina
STSébastien Tixeuil
Sébastien Tixeuil
We revisit Byzantine-tolerant reliable broadcast with honest dealer algorithms in multi-hop networks. To tolerate Byzantine faulty nodes arbitrarily spread over the network, previous solutions require a factorial number of messages to be sent over the network if the messages are not authenticated (e.g., digital signatures are not available). We propose modifications that preserve the safety and liveness properties of the original unauthenticated protocols, while highly decreasing their observed message complexity when simulated on several classes of graph topologies, potentially opening to their employment.

20 October 2018
Verified
Book Chapter
Closed access
PDF file
SBSilvia Bonomi
Silvia Bonomi
Giovanni FarinaGiovanni Farina
Giovanni Farina
STSébastien Tixeuil
Sébastien Tixeuil

2 July 2024 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
SBSilvia Bonomi
Silvia Bonomi
Giovanni FarinaGiovanni Farina
Giovanni Farina
STSébastien Tixeuil
Sébastien Tixeuil

1 November 2017 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
JAJordan Adamek
Jordan Adamek
Giovanni FarinaGiovanni Farina
Giovanni Farina
MNMikhail Nesterenko
Mikhail Nesterenko
STSébastien Tixeuil
Sébastien Tixeuil