Carla Mascia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Carla Mascia has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Giancarlo Rinaldo
Department of Mathematics, Informatics, Physics and Earth science, University of Messina, Messina, Italy
8 shared publications - Francesco Romeo
Department of Mathematics, University of Trento, Povo (Trento), Italy
4 shared publications - Massimiliano Sala
University of Trento
3 shared publications - Alberto Lerda
University of Trento, Trento, Italy
2 shared publications - Massimo Caboara
Department of Mathematics University of Pisa Italy
2 shared publications - Alessio Meneghetti
Department of Mathematics, University of Bari Aldo Moro, Bari, Italy
1 shared publication
Latest Publications
- Open Access
- 1 January 2026
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 20 (1)
Approaches to MEV in DAG-based DLTs
Maximal extractable value (MEV) refers to value extracted from a decentralised ledger by manipulation of transaction ordering. Although MEV can be challenging to define consistently across contexts, it is widely recognised as a significant threat to the fairness and viability of decentralised ledger technologies (DLTs), as it enables the extraction of considerable value at the expense of regular users. MEV in traditional blockchains has been extensively studied, particularly in platforms like Ethereum. In these systems, MEV typically arises from the ability of miners, validators, or sequencers to reorder, insert, or censor transactions within a block, leading to well-known attack strategies such as front-running, back-running, and sandwich attacks. MEV in DAG-based DLTs presents both similarities and critical differences compared to traditional blockchain systems. While the incentive to manipulate transaction ordering persists, the underlying structure of DAG-based DLTs (where blocks, and transactions therein, have multiple predecessors rather than a single one) creates new opportunities and challenges for extraction. Here, MEV may rather act on reordering blocks than the single transactions enclosed in a block. Most extraction methods designed for linear blockchains are ineffective or inapplicable on DAGs. Our contribution is twofold: (i) we review and provide an organic accounting of MEV in blockchain to identify key attack vectors and mitigation strategies. Furthermore, we survey the emerging MEV attack opportunities in DAG-based DLT, a useful summary for such a recent and evolving DLT framework; and (ii) building on the insights gained in (i), we propose an original mitigation strategy, which leverages fully homomorphic encryption (FHE) to enhance MEV-resistance in the Hedera’s DAG-based DLT architecture.
- 1 January 2026
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 20 (1)
Open AccessApproaches to MEV in DAG-based DLTs
Maximal extractable value (MEV) refers to value extracted from a decentralised ledger by manipulation of transaction ordering. Although MEV can be challenging to define consistently across contexts, it is widely recognised as a significant threat to the fairness and viability of decentralised ledger technologies (DLTs), as it enables the extraction of considerable value at the expense of regular users. MEV in traditional blockchains has been extensively studied, particularly in platforms like Ethereum. In these systems, MEV typically arises from the ability of miners, validators, or sequencers to reorder, insert, or censor transactions within a block, leading to well-known attack strategies such as front-running, back-running, and sandwich attacks. MEV in DAG-based DLTs presents both similarities and critical differences compared to traditional blockchain systems. While the incentive to manipulate transaction ordering persists, the underlying structure of DAG-based DLTs (where blocks, and transactions therein, have multiple predecessors rather than a single one) creates new opportunities and challenges for extraction. Here, MEV may rather act on reordering blocks than the single transactions enclosed in a block. Most extraction methods designed for linear blockchains are ineffective or inapplicable on DAGs. Our contribution is twofold: (i) we review and provide an organic accounting of MEV in blockchain to identify key attack vectors and mitigation strategies. Furthermore, we survey the emerging MEV attack opportunities in DAG-based DLT, a useful summary for such a recent and evolving DLT framework; and (ii) building on the insights gained in (i), we propose an original mitigation strategy, which leverages fully homomorphic encryption (FHE) to enhance MEV-resistance in the Hedera’s DAG-based DLT architecture.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (6) , 1710-1722
An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG
In this paper, we propose an algebraic attack on stream ciphers. Starting from a well-known attack due to Courtois and Meier, we design an attack especially effective against nonlinear filter generators. First, we test it on two toy stream ciphers and then we show that the level of security of WG-PRNG, one of the stream ciphers submitted to the NIST competition on Lightweight Cryptography, is less than that claimed until now.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (6) , 1710-1722
An algebraic attack on stream ciphers with application to nonlinear filter generators and WG-PRNG
In this paper, we propose an algebraic attack on stream ciphers. Starting from a well-known attack due to Courtois and Meier, we design an attack especially effective against nonlinear filter generators. First, we test it on two toy stream ciphers and then we show that the level of security of WG-PRNG, one of the stream ciphers submitted to the NIST competition on Lightweight Cryptography, is less than that claimed until now.
- Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (5) , 1251-1289
A survey on functional encryption
Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 17 (5) , 1251-1289
Open AccessA survey on functional encryption
Functional Encryption (FE) expands traditional public-key encryption in two different ways: it supports fine-grained access control and allows learning a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, we mention several schemes for each class, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.
- Open Access
- 5 October 2022
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 57 (2) , 589-615
$(S_2)$-condition and Cohen–Macaulay binomial edge idealsWe describe the simplicial complex $$\Delta $$ such that the initial ideal of the binomial edge ideal $$J_\textrm{G}$$ of G is the Stanley-Reisner ideal of $$\Delta $$ . By using $$\Delta $$ we show that if $$J_\textrm{G}$$ is $$(S_2)$$ , then G is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3 and we define a new infinite class of accessible blocks with whiskers for any cycle rank. Finally, by using a computational approach, we show that the graphs with at most 12 vertices whose binomial edge ideal is Cohen–Macaulay are all and only the accessible ones.- 5 October 2022
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 57 (2) , 589-615
Open Access$(S_2)$-condition and Cohen–Macaulay binomial edge idealsWe describe the simplicial complex $$\Delta $$ such that the initial ideal of the binomial edge ideal $$J_\textrm{G}$$ of G is the Stanley-Reisner ideal of $$\Delta $$ . By using $$\Delta $$ we show that if $$J_\textrm{G}$$ is $$(S_2)$$ , then G is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3 and we define a new infinite class of accessible blocks with whiskers for any cycle rank. Finally, by using a computational approach, we show that the graphs with at most 12 vertices whose binomial edge ideal is Cohen–Macaulay are all and only the accessible ones. - Open Access
- 29 June 2022
- Published by MDPI AG in Cryptography
- Vol. 6 (3) , 32
Adaptable Cryptographic Primitives in Blockchains via Smart Contracts
Blockchain-based platforms utilise cryptographic protocols to enforce the correct behaviour of users, as well as to guarantee a sufficient level of protection against malicious adversaries. Cryptography is, however, an ever-evolving discipline, and any breakthrough would have immediate consequences on the security of blockchain-based applications. A possible threat currently under investigation is given by the development of quantum computers, since several wide-adopted cryptographic protocols have been proved to be unsafe against quantum-capable adversaries. In this work, we propose a novel approach for the management of cryptographic primitives in smart-contract-based ledgers, discussing how it fits in both a (partially) permissioned and a fully permissionless setting. The cryptographic protocols are managed in a flexible manner via a set of smart-contracts defined on the ledger itself, in this way the choice of algorithms and parameters can change quickly. Among the advantages of this approach, we remark how it allows designing an adaptive post-quantum-based blockchain that keeps up with ongoing technological advances. In general, the introduction of new features and the application of fixes to a blockchain cause forks in the chain, which may cause major disruptions. The use of smart contracts in blockchain management allows to avoid this problem, dynamically introducing new protocols or deprecating old ones without compromising previous data. The Cryptographic Kernel approach has been adopted by Quadrans, an open-source, public, decentralised smart-contract-based blockchain with a specific focus on the needs of industry, complex supply chains, and IOT devices.
- 29 June 2022
- Published by MDPI AG in Cryptography
- Vol. 6 (3) , 32
Open AccessAdaptable Cryptographic Primitives in Blockchains via Smart Contracts
Blockchain-based platforms utilise cryptographic protocols to enforce the correct behaviour of users, as well as to guarantee a sufficient level of protection against malicious adversaries. Cryptography is, however, an ever-evolving discipline, and any breakthrough would have immediate consequences on the security of blockchain-based applications. A possible threat currently under investigation is given by the development of quantum computers, since several wide-adopted cryptographic protocols have been proved to be unsafe against quantum-capable adversaries. In this work, we propose a novel approach for the management of cryptographic primitives in smart-contract-based ledgers, discussing how it fits in both a (partially) permissioned and a fully permissionless setting. The cryptographic protocols are managed in a flexible manner via a set of smart-contracts defined on the ledger itself, in this way the choice of algorithms and parameters can change quickly. Among the advantages of this approach, we remark how it allows designing an adaptive post-quantum-based blockchain that keeps up with ongoing technological advances. In general, the introduction of new features and the application of fixes to a blockchain cause forks in the chain, which may cause major disruptions. The use of smart contracts in blockchain management allows to avoid this problem, dynamically introducing new protocols or deprecating old ones without compromising previous data. The Cryptographic Kernel approach has been adopted by Quadrans, an open-source, public, decentralised smart-contract-based blockchain with a specific focus on the needs of industry, complex supply chains, and IOT devices.
- 15 June 2022
- Published by Springer Nature
- p. 365-375
Asset Sensitivity for Aligning Risk Assessment Across Multiple Units in Complex Organizations
- 15 June 2022
- Published by Springer Nature
- p. 365-375
Asset Sensitivity for Aligning Risk Assessment Across Multiple Units in Complex Organizations
- 6 February 2022
- Published by Wiley in Mathematische Nachrichten
- Vol. 295 (3) , 593-606
Primality of polyomino ideals by quadratic Gröbner basis
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2‐minors as graded reverse lexicographic Gröbner basis, due to combinatorial properties of the polyomino itself. Moreover, we prove that when the latter holds the polyomino ideal coincides with the lattice ideal associated to the polyomino, that is the polyomino ideal is prime. As an application, we describe two new infinite families of prime polyominoes.
- 6 February 2022
- Published by Wiley in Mathematische Nachrichten
- Vol. 295 (3) , 593-606
Primality of polyomino ideals by quadratic Gröbner basis
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2‐minors as graded reverse lexicographic Gröbner basis, due to combinatorial properties of the polyomino itself. Moreover, we prove that when the latter holds the polyomino ideal coincides with the lattice ideal associated to the polyomino, that is the polyomino ideal is prime. As an application, we describe two new infinite families of prime polyominoes.
- 1 January 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 33 (1) , 3-20
A partial characterization of Hilbert quasi-polynomials in the non-standard case
- 1 January 2022
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 33 (1) , 3-20
A partial characterization of Hilbert quasi-polynomials in the non-standard case
- Open Access
$(S_2)$-condition and Cohen-Macaulay binomial edge ideals
We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3 and we define a new infinite class of accessible blocks with whiskers for any cycle rank. Finally, by using a computational approach, we show that the graphs with at most 12 vertices whose binomial edge ideal is Cohen-Macaulay are all and only the accessible ones.Open Access$(S_2)$-condition and Cohen-Macaulay binomial edge ideals
We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with whiskers of cycle rank 3 and we define a new infinite class of accessible blocks with whiskers for any cycle rank. Finally, by using a computational approach, we show that the graphs with at most 12 vertices whose binomial edge ideal is Cohen-Macaulay are all and only the accessible ones. - Open Access
Primality of polyomino ideals by quadratic Gröbner basis
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we prove that when the latter holds the ideal coincides with the lattice ideal associated to the polyomino, that is the ideal is prime. As an application, we describe two new infinite families of prime polyominoes.
Open AccessPrimality of polyomino ideals by quadratic Gröbner basis
In this work, we provide a necessary and sufficient condition on a polyomino ideal for having the set of inner 2-minors as degree reverse lexicographic Gr\"obner basis, due to combinatorial properties of the polyomino itself. Moreover, we prove that when the latter holds the ideal coincides with the lattice ideal associated to the polyomino, that is the ideal is prime. As an application, we describe two new infinite families of prime polyominoes.