Estimation of the Probability of Success of a Suppression Attack
DOI:
https://doi.org/10.20535/tacs.2664-29132025.1.332340Abstract
This work presents the results of research on suppression attacks, which are a specific case of frontrunning attacks. We provide a formal step-by-step algorithm for executing the attack, along with a mathematical model and explicit analytical formulas for calculating an upper bound on the success probability of such an attack with numerical examples.
This study continues the research presented in [1], which investigated insertion and displacement attacks.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
