2 results
Search Results
Now showing 1 - 2 of 2
Conference Object Citation - WoS: 13A Decentralized Application for Secure Messaging in a Trustless Environment(Ieee, 2018) Abdulaziz, Mohamed; Culha, Davut; Yazici, AliBlockchain technology has been seeing widespread interest as a means to ensure the integrity, confidentiality and availability of data in a trustless environment. They are designed to protect data from both internal and external cyberattacks by utilizing the aggregated power of the network to resist malicious efforts. In this article, we will create our own decentralized messaging application utilizing the Ethereum Whisper protocol. Our application will be able to send encrypted messages both securely and anonymously. We will utilize the Ethereum platform to deploy our blockchain network. This application would be resistant to most suppression tactics due to its distributed nature and adaptability of its communication protocol.Article Binary Tree Blockchain of Decomposed Transactions(Graz University of Technology, Institute of Information Systems and Computer Media (IICM), 2025) Culha, DavutWidespread adoption of blockchain technologies requires scalability. To achieve scalability, various methods are applied, including new consensus algorithms, directed acyclic graph solutions, sharding solutions, and off-chain solutions. Sharding solutions are particularly promising as they distribute workload across different parts of the blockchain network. Similarly, directed acyclic graphs use graph data structures to distribute workload effectively. In this work, a binary tree data structure is used to enhance blockchain scalability. Binary trees offer several advantages, such as the ability to address nodes with binary numbers, providing a straightforward and efficient method for identifying and locating nodes. Each node in the tree contains a block of transactions, which allows for transactions to be directed to specific paths within the tree. This directionality not only increases scalability by enabling parallel processing of transactions but also ensures that the blockchain can handle a higher volume of transactions without becoming congested. Moreover, transactions are decomposed into transaction elements, improving the immutability of the binary tree blockchain. This novel decomposition process helps to minimize the computational overhead required for calculating account balances, making the system more efficient. By breaking down transactions into their fundamental components, the system can process and verify transactions more rapidly and accurately. This approach effectively realizes implicit sharding using a binary tree structure, distributing the processing load more evenly and reducing bottlenecks. The proposed method is simulated to assess its performance. Experimental results demonstrate that the proposed method achieves a significantly higher transaction throughput of 32307 transactions per second. Furthermore, block generation times decrease as the system scales, with an average block generation time of 0.13 seconds, underscoring the efficiency of the binary tree blockchain structure.
