Fixed Transaction Ordering and Admission in Blockchains Research Overview
Research overview on developing a Fixed Transaction Ordering and Admission algorithm for Ethereum blockchain to address issues with transaction execution reliability and security. The algorithm aims to prevent miners from influencing transaction order and selection, promoting reduced commit times and censorship resistance in a Byzantine setting.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Fixed transaction ordering and admission in blockchains PhD advisors: Jo o Barreto Miguel Matos Paulo Mendes da Silva psilva@gsd.inesc-id.pt INESC-ID / IST Universidade de Lisboa PhD stage: Early stage. Started March 2017. Research area: Distributed systems, blockchains, Ethereum, total order, dissemination. 1
Work motivation and overview 1) Ethereum transaction execution order and admittance are unreliable. 2) Insufficient funds, double spending attacks and long transaction commit times. 3) Fixed transaction ordering and admission to blockchains 4) Reduced transaction commit time and no transaction censorship. 2
Approach Develop a Fixed Transaction Ordering and Admission (FTOA) algorithm for Ethereum. Prevent miners from deciding how to order transactions and which transactions to include, using: Epidemic total order algorithm Logical timestamps Byzantine setting 3 Fixed transaction ordering and admission in blockchains
Recap: Prevent miners from deciding how to order transactions and which transactions to include, using an epidemic total order algorithm and logical timestamps in a Byzantine setting. Thank you. Questions? Blockchains. Ethereum. Transaction ordering. Epidemic total order with logical timestamps in Byzantine setting. Fixed transaction ordering and admission. Acknowledgements: This work is supported by the Portuguese National Science Foundation under Grants with references SFRH/BD/130017/2017 and UID/CEC/50021/2013. 5 Fixed transaction ordering and admission in blockchains
