Amirali Ebrahimzadeh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Amirali Ebrahimzadeh has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Ali Mehri
Endoscopic and Minimally Invasive Surgery Research Center Mashhad University of Medical Sciences Mashhad Iran
1 shared publication - Asieh Sadat Fattahi
Department of Surgery, Faculty of Medicine, Endoscopic and Minimally Invasive Research Center, Mashhad University of Medical Sciences, Mashhad, Iran
1 shared publication - Krishnendu Chatterjee
IST Austria, Klosterneuburg, Austria
1 shared publication - Krzysztof Pietrzak
ISTA
1 shared publication Maryam Hoseini
General Surgeon, Department of Surgery, Endoscopic and Minimally Invasive Research Center, Mashhad University of Medical Sciences, Mashhad, Iran
1 shared publication- Mehrdad Karrabi
IST Austria, Klosterneuburg, Austria
1 shared publication
Latest Publications
- 16 November 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 184, 109412
Explainable machine learning versus known nomogram for predicting non-sentinel lymph node metastases in breast cancer patients: A comparative study
- 16 November 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 184, 109412
Explainable machine learning versus known nomogram for predicting non-sentinel lymph node metastases in breast cancer patients: A comparative study
- Open Access
- 17 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 268-278
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected relative revenue in the MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be any specified precision. Our analysis is fully automated and provides formal guarantees on the correctness. We evaluate our selfish mining attack and observe that it achieves superior expected relative revenue compared to two considered baselines. In concurrent work [Sarenche FC'24] does an automated analysis on selfish mining in predictable longest-chain blockchains based on efficient proof systems. Predictable means the randomness for the challenges is fixed for many blocks (as used e.g., in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the challenge is derived from the previous block.
- 17 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 268-278
Open AccessFully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected relative revenue in the MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be any specified precision. Our analysis is fully automated and provides formal guarantees on the correctness. We evaluate our selfish mining attack and observe that it achieves superior expected relative revenue compared to two considered baselines. In concurrent work [Sarenche FC'24] does an automated analysis on selfish mining in predictable longest-chain blockchains based on efficient proof systems. Predictable means the randomness for the challenges is fixed for many blocks (as used e.g., in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the challenge is derived from the previous block.