Sara Tucci-Piergiovanni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Sara Tucci-Piergiovanni has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
Roberto Baldoni
Dipt. di Inf. e Sist., Sapienza Univ. di Roma, Rome, Italy
13 shared publications- Tiphaine Henry
Université Paris-Saclay, CEA, List
5 shared publications Chokri Mraidha
4 shared publications- Leonardo Querzoni
Sapienza University of Rome, Rome, Italy
4 shared publications - Rida A. Bazzi
Arizona State University
4 shared publications - Antonella Del Pozzo
Université Paris-Saclay CEA F-91120 Palaiseau List France
3 shared publications
Latest Publications
- Open Access
- 6 December 2025
- Published by Elsevier in Blockchain: Research and Applications
Secrets on the Chain: Cryptographic Blockchain Patterns for Verifiable and Confidential Data Handling
- 6 December 2025
- Published by Elsevier in Blockchain: Research and Applications
Open AccessSecrets on the Chain: Cryptographic Blockchain Patterns for Verifiable and Confidential Data Handling
- 18 November 2025
- Published by Springer Nature
- p. 253-269
Label Leakage in Regression Federated Learning Using Cryptographic Tools
- 18 November 2025
- Published by Springer Nature
- p. 253-269
Label Leakage in Regression Federated Learning Using Cryptographic Tools
- Open Access
- 8 October 2025
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 4 (4) , 1-28
Ethereum Proof-of-Stake and the Probabilistic Bouncing Attack
Ethereum has undergone a recent change called the Merge , which made Ethereum a Proof-of-Stake blockchain shifting closer to BFT consensus. Ethereum, which wishes to keep the best of the two protocol designs (BFT and Nakomoto-style), now has a convoluted consensus protocol as its core. The result is a blockchain possibly being produced in a tree-like form while participants try to finalize blocks. We categorize different attacks jeopardizing the liveness of the protocol. The Ethereum community has responded by creating patches against some of them. We discovered a new attack on the patched protocol. To support our analysis, we propose a new high-level formalization of the properties of liveness and availability of the Ethereum blockchain, and we provide pseudo-code. We believe this formalization to be useful for other analyses as well. Our results yield that the Ethereum Proof-of-Stake has safety but only probabilistic liveness. The probability of the liveness is influenced by the parameter describing the time frame allowed for validators to change their mind about the current main chain.
- 8 October 2025
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
- Vol. 4 (4) , 1-28
Open AccessEthereum Proof-of-Stake and the Probabilistic Bouncing Attack
Ethereum has undergone a recent change called the Merge , which made Ethereum a Proof-of-Stake blockchain shifting closer to BFT consensus. Ethereum, which wishes to keep the best of the two protocol designs (BFT and Nakomoto-style), now has a convoluted consensus protocol as its core. The result is a blockchain possibly being produced in a tree-like form while participants try to finalize blocks. We categorize different attacks jeopardizing the liveness of the protocol. The Ethereum community has responded by creating patches against some of them. We discovered a new attack on the patched protocol. To support our analysis, we propose a new high-level formalization of the properties of liveness and availability of the Ethereum blockchain, and we provide pseudo-code. We believe this formalization to be useful for other analyses as well. Our results yield that the Ethereum Proof-of-Stake has safety but only probabilistic liveness. The probability of the liveness is influenced by the parameter describing the time frame allowed for validators to change their mind about the current main chain.
- 27 August 2025
- Published by Springer Nature
- p. 221-237
Leveraging the Diamond Pattern for Scalable and Upgradeable Blockchain-Based Business Process Management Applications
- 27 August 2025
- Published by Springer Nature
- p. 221-237
Leveraging the Diamond Pattern for Scalable and Upgradeable Blockchain-Based Business Process Management Applications
- Open Access
- 27 January 2025
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 16 (1) , 645-665
Adversary-Augmented Simulation for Fairness Evaluation and Defense in Hyperledger Fabric
This paper presents an adversary model and a simulation framework specifically tailored for analyzing attacks on distributed systems composed of multiple distributed protocols, with a focus on assessing the security of blockchain networks. Our model classifies and constrains adversarial actions based on the assumptions of the target protocols—defined by failure models, communication models, and the fault tolerance thresholds of Byzantine Fault Tolerant (BFT) protocols. The goal is to study not only the intended effects of adversarial strategies but also their unintended side effects on critical system properties. We apply this framework to analyze fairness properties in a Hyperledger Fabric (HF) blockchain network. Our focus is on novel fairness attacks that involve coordinated adversarial actions across various HF services. Simulations show that even a constrained adversary can violate fairness with respect to specific clients (client fairness) and impact related guarantees (order fairness), which relate the reception order of transactions to their final order in the blockchain. This paper significantly extends our previous work by introducing and evaluating a mitigation mechanism specifically designed to counter transaction reordering attacks. We implement and integrate this defense into our simulation environment, demonstrating its effectiveness under diverse conditions.
- 27 January 2025
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 16 (1) , 645-665
Open AccessAdversary-Augmented Simulation for Fairness Evaluation and Defense in Hyperledger Fabric
This paper presents an adversary model and a simulation framework specifically tailored for analyzing attacks on distributed systems composed of multiple distributed protocols, with a focus on assessing the security of blockchain networks. Our model classifies and constrains adversarial actions based on the assumptions of the target protocols—defined by failure models, communication models, and the fault tolerance thresholds of Byzantine Fault Tolerant (BFT) protocols. The goal is to study not only the intended effects of adversarial strategies but also their unintended side effects on critical system properties. We apply this framework to analyze fairness properties in a Hyperledger Fabric (HF) blockchain network. Our focus is on novel fairness attacks that involve coordinated adversarial actions across various HF services. Simulations show that even a constrained adversary can violate fairness with respect to specific clients (client fairness) and impact related guarantees (order fairness), which relate the reception order of transactions to their final order in the blockchain. This paper significantly extends our previous work by introducing and evaluating a mitigation mechanism specifically designed to counter transaction reordering attacks. We implement and integrate this defense into our simulation environment, demonstrating its effectiveness under diverse conditions.
- 30 November 2024
- Published by Springer Nature
- p. 207-221
A Comparative Gas Cost Analysis of Proxy and Diamond Patterns in EVM Blockchains for Trusted Smart Contract Engineering
- 30 November 2024
- Published by Springer Nature
- p. 207-221
A Comparative Gas Cost Analysis of Proxy and Diamond Patterns in EVM Blockchains for Trusted Smart Contract Engineering
- Open Access
- 26 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 126-135
Adversary-Augmented Simulation to evaluate order-fairness on HyperLedger Fabric
- 26 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 126-135
Open AccessAdversary-Augmented Simulation to evaluate order-fairness on HyperLedger Fabric
- Open Access
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-246
Extending the Scope of Gradient Reconstruction Attacks in Federated Averaging
Federated Learning (FL) has gained prominence as a decentralized and privacy-preserving paradigm that enables multiple clients to collaboratively train a machine learning model under the supervision of a central server. Instead of centralizing the data, clients keep their data locally and share only model parameters during multiple communication rounds. However, recent attacks, such as gradient reconstruction attacks (GRAs) show privacy issues when an attacker knows the communication of a client. In the literature, these privacy issues are mainly explored when clients compute new parameters using a single gradient descent step on their data (FedSGD) and then send them back to the remote server. In a more realistic scenario, the clients' protocol is based on several gradient descent steps (FedAvg). This protocol adds intermediate computation steps, which are unknown from the attacker, thus making GRAs less successful. In this incremental paper, we conduct exhaustive experiments on four state-of-the-art attacks under the FedAvg protocol, on a very basic and a more complex neural network (ResNet-18) with CIFAR100 dataset. These experiments provide the following results 1) a privacy-utility trade-off analysis, 2) insights on the choice of attacks' hyperparameters, 3) the client's local learning rate has little impact on attacks' effectiveness 4) a proof that the privacy risk is not necessarily decreasing over rounds, contrary to common belief.
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 235-246
Open AccessExtending the Scope of Gradient Reconstruction Attacks in Federated Averaging
Federated Learning (FL) has gained prominence as a decentralized and privacy-preserving paradigm that enables multiple clients to collaboratively train a machine learning model under the supervision of a central server. Instead of centralizing the data, clients keep their data locally and share only model parameters during multiple communication rounds. However, recent attacks, such as gradient reconstruction attacks (GRAs) show privacy issues when an attacker knows the communication of a client. In the literature, these privacy issues are mainly explored when clients compute new parameters using a single gradient descent step on their data (FedSGD) and then send them back to the remote server. In a more realistic scenario, the clients' protocol is based on several gradient descent steps (FedAvg). This protocol adds intermediate computation steps, which are unknown from the attacker, thus making GRAs less successful. In this incremental paper, we conduct exhaustive experiments on four state-of-the-art attacks under the FedAvg protocol, on a very basic and a more complex neural network (ResNet-18) with CIFAR100 dataset. These experiments provide the following results 1) a privacy-utility trade-off analysis, 2) insights on the choice of attacks' hyperparameters, 3) the client's local learning rate has little impact on attacks' effectiveness 4) a proof that the privacy risk is not necessarily decreasing over rounds, contrary to common belief.
- Open Access
- 17 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 295-305
The Fractional Spending Problem: Executing Payment transactions in parallel with less thanf+1 validations
We consider the problem of supporting payment transactions in an asynchronous system in which up to f validators are subject to Byzantine failures under the control of an adaptive adversary. It was shown that, in the case of a single owner, this problem can be solved without consensus by using byzantine quorum systems (requiring a quorum of 2f + 1 validations per transaction). Nonetheless, the process of validating transactions remains sequential. For example, if one has a balance of ten coins and intends to make separate payments of two coins each to two distinct recipients, both transactions must undergo processing by a common correct validator. On the other hand, these two transactions are non-conflicting as they do not lead to double spending, allowing in principle for parallel validation. In this paper, we show that it is possible to validate payment transactions in parallel with less than f validations per transaction in an asynchronous system, provided that each transaction spends only a small fraction of a balance. Our solution relies on a novel class of probabilistic quorum systems that we introduce in this paper, termed (k1, k2) -quorum systems. In the absence of an adaptive adversary, (k1,k2)-quorum systems can be used to enable concurrent and asynchronous validation of up to k1 transactions while preventing validation of more than k2 transactions. In the presence of an adaptive adversary, at least k1 transactions can be validated concurrently, but validation of more than k′2 > k2 transactions is prevented, with the difference k′2 − k2 dependent on the quorum system's validation slack -- a term defined in this paper. Employing a (k1, k2)-quorum system, we introduce protocols enabling a payer to validate multiple fractional spending transactions in parallel with less than f + 1 validations per transaction. Subsequently, the payer reclaims any remaining funds through a fully validated transaction, referred to as a settlement transaction.
- 17 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 295-305
Open AccessThe Fractional Spending Problem: Executing Payment transactions in parallel with less thanf+1 validations
We consider the problem of supporting payment transactions in an asynchronous system in which up to f validators are subject to Byzantine failures under the control of an adaptive adversary. It was shown that, in the case of a single owner, this problem can be solved without consensus by using byzantine quorum systems (requiring a quorum of 2f + 1 validations per transaction). Nonetheless, the process of validating transactions remains sequential. For example, if one has a balance of ten coins and intends to make separate payments of two coins each to two distinct recipients, both transactions must undergo processing by a common correct validator. On the other hand, these two transactions are non-conflicting as they do not lead to double spending, allowing in principle for parallel validation. In this paper, we show that it is possible to validate payment transactions in parallel with less than f validations per transaction in an asynchronous system, provided that each transaction spends only a small fraction of a balance. Our solution relies on a novel class of probabilistic quorum systems that we introduce in this paper, termed (k1, k2) -quorum systems. In the absence of an adaptive adversary, (k1,k2)-quorum systems can be used to enable concurrent and asynchronous validation of up to k1 transactions while preventing validation of more than k2 transactions. In the presence of an adaptive adversary, at least k1 transactions can be validated concurrently, but validation of more than k′2 > k2 transactions is prevented, with the difference k′2 − k2 dependent on the quorum system's validation slack -- a term defined in this paper. Employing a (k1, k2)-quorum system, we introduce protocols enabling a payer to validate multiple fractional spending transactions in parallel with less than f + 1 validations per transaction. Subsequently, the payer reclaims any remaining funds through a fully validated transaction, referred to as a settlement transaction.