Follow blockchain research across journals, conferences, and preprint repositories.
2,071 results · page 29 of 87
Sara Barj, Aafaf Ouaddah, Abdellatif Mezrioui
No abstract is available for this record.
Thierry Sans, Ziming Liu, Kevin Oh
No abstract is available for this record.
Thibauld Feneuil, Matthieu Rivain
No abstract is available for this record.
Dalia Elwi, Osama Abu-Elnasr, A. S. Tolba, Samir Elmougy
Blockchain is a Distributed Ledger Technology (DLT) that allows users to exchange values directly without a need for trusted third parties. Bitcoin is one of the most popular digital cryptocurrencies that is based on blockchain technology. However, it faces scalability problems including transaction throughput, latency, and starvation. Bitcoin transaction throughput is very low compared to traditional payment methods. Additionally, many Bitcoin transactions suffer from delays and starvation as miners prefer transactions with higher fees. More of the current research focuses on how to enhance Bitcoin scalability by improving the performance of consensus techniques, dividing the network into smaller ones with different parts of the blockchain, or completely changing the blockchain data structure. Unfortunately, engaging in this problem usually affects either decentralization or security; this is called the blockchain trilemma. This paper proposes the Cooperative Mining System (CMS), which depends on enhanced proof of work consensus algorithm. This proposed system increases transaction throughput and eliminates transaction latency and starvation without affecting decentralization and security. In CMS for each epoch, miners cooperated to create one super-block that contains more transactions than the traditional Bitcoin block. Whereas miners create their traditional blocks simultaneously, broadcast them, wait to receive other miners’ blocks, and lastly create a super-block that contains all the transactions of the gathered blocks. The Simulation results of the CMS and Bitcoin system using different case scenarios show a significant improvement in CMS compared to the current Bitcoin system. The CMS greatly increases the transaction throughput and eliminates transaction latency and starvation.
Марчук Олександр
У кваліфікаційній роботі бакалавра було проведено аналіз архітектури криптовалют та особливостей використання цифрового підпису в криптовалютах. Було розглянуто основні принципи криптовалют, зокрема децентралізацію, роль журналу транзакцій та принципи консенсусу, такі як proof of work та proof of stake. Також було досліджено застосування криптографії в криптовалютах, зокрема генерацію приватних та публічних ключів, еліптичну криптографію та хеш-функції. Було проведено аналіз основних алгоритмів цифрового підпису. Були розглянуті алгоритми RSA, DSA, ECDSA та EdDSA. Досліджено структуру та безпеку цих алгоритмів, а також механізми, на яких вони ґрунтуються. Виявлено, що EdDSA є простішим у реалізації та розумінні порівняно з ECDSA, при цьому забезпечуючи подібний рівень безпеки. Було реалізовано програму для використання цифрових підписів з використанням обговорених алгоритмів. Було описано процес реалізації програми, вибір та підключення необхідних бібліотек, а також розроблено інтерфейси та функціонал для роботи з цифровим підписом. Ключові слова : цифрові підписи, еліптичні криві, еліптичні криві Едвардса, криптовалюта, JAVA.
Zhengwei Ren, Guangxin He, Rongwei Yu, Yan Tong · 6 authors
No abstract is available for this record.
Duc Khai Lam, Quoc Linh Phan, Quoc Truong Nguyen, Van Quang Tran
No abstract is available for this record.
N. P. Larionov, Yury Yanovich
Bitcoin uses an unspent transaction output (UTXO) model for coin circulation, which is similar to the banknotes. The transaction history is publicly available and allows to trace cryptocurrency flows. Different users merge transactions into a single bigger one to tangle flows. The merged transaction is called a shared send mixer (SSM). One can try to find the original subtransactions–solve an untangling problem. Based on the number of untanglings and their size, one extracts additional information about coin circulation. Theoretical analysis of the untangling problem is known from the literature. The paper aims to collect statistics of the SSM usage by transaction type for Bitcoin blockchain. We propose an algorithm to solve the problem, prove its correctness, and provide a source code. We applied the algorithm to the Bitcoin historical data. 15% transactions are SSM, and 90% of them allow unique untangling. The future work is an algorithm application to other UTXO systems and the results adaptation to an address grouping.
Radhika Moondra, Vikas Sihag, Gaurav Choudhary
No abstract is available for this record.
Anubha Jain, Emmanuel S. Pilli
No abstract is available for this record.
Mehmet Sabır Kiraz, Enrique Larraia, Owen Vaughan
No abstract is available for this record.
Prabuddh Kumar Ashok, Arun Solanki
No abstract is available for this record.
Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, Sushmita Ruj
No abstract is available for this record.
Michal Jirásek
No abstract is available for this record.
Satpal Singh Kushwaha, Sandeep Joshi
No abstract is available for this record.
Natsuki Fujiwara, Shohei Yokoyama
Our proposed method utilizes blockchain technology to safeguard the ownership of specific regions within image data. In our approach, diverse values could be assigned to each region based on its importance, and only users with ownership rights can access these designated regions. This ensures the protection of ownership rights for individuals in any given region of an image. Identified regions are individually encrypted using an XOR cipher, and a corresponding key image is generated for decryption, thereby preserving the privacy of the encrypted region. Non-fungible tokens (NFTs) are employed to protect the key image and manage the ownership of each object in the image data. The NFT for the key image is generated by the key holder (who possesses the entire image), and the ownership NFT is acquired by the user who needs access to the key NFT. Furthermore, the ownership NFT and the key NFT are verified for a match by the judgment function, and only upon successful validation, the NFT is displayed on the screen. This method enables different values to be assigned to various parts of an image, facilitating the transfer and sharing of ownership. Additionally, the original image?s owner can benefit financially based on the value of the image, thus enhancing the overall security of image data.
P. Divya, B. Bharath Sudha Chandra, Y. Harsha Vardhan, T. Ananth Kumar · 6 authors
No abstract is available for this record.
Cheng You, Yanjia Qin, Qi Chen, Chang Chen · 5 authors
Blockchain was known by Satoshi Nakamoto in 2008 because of bitcoin. After more than a decade of development, blockchain has been widely applied in medical, digital finance, and electronic evidence, and others. At present, there are dozens of different consensus algorithms for different application context, such as proof of work, proof of stake, delegate proof of stake (DPoS), and proof of reputation. The DPoS consensus mechanism selects proxy nodes for block generation and confirmation through node voting, which can achieve fast block verification and adapt to a wide range of business areas. Aiming at the problems of DPoS consensus mechanism, such as giant monopoly, inactive voting, and high centralization, we puts forward the heat attenuation mechanism. The heat attenuation mechanism mildly punishes those nodes that maintain high ranking for a long time, which reduces the phenomenon of giant monopoly and enhances the degree of decentralization of the whole network. This article proposes the heat attenuation mechanism and the benefit distribution scheme. The heat attenuation mechanism improves the degree of decentralization of the blockchain network. The benefit distribution scheme makes sure that every node participating in the voting can get income. Finally, the feasibility and correctness of the consensus algorithm is proved by simulation experiments of the blockchain system.
Durgesh Kumar, Rajendra Kumar Dwivedi
No abstract is available for this record.
E. Mutharasan, J. Bharathi, KUMAR R. NITHESH, Sanjay K. Bose · 6 authors
No abstract is available for this record.
Suhas Harbola, Jyotsna Yadav, Rahul Johari, E. Verma · 5 authors
No abstract is available for this record.
Ye Tao, Ehsan Javanmardi, Pengfei Lin, Jin Nakazato · 7 authors
Cooperative perception is crucial for connected automated vehicles in intelligent transportation systems (ITSs); however, ensuring the authenticity of perception data remains a challenge as the vehicles cannot verify events that they do not witness independently. Various studies have been conducted on establishing the authenticity of data, such as trust-based statistical methods and plausibility-based methods. However, these methods are limited as they require prior knowledge such as previous sender behaviors or predefined rules to evaluate the authenticity. To overcome this limitation, this study proposes a novel approach called zero-knowledge Proof of Traffic (zk-PoT), which involves generating cryptographic proofs to the traffic observations. Multiple independent proofs regarding the same vehicle can be deterministically cross-verified by any receivers without relying on ground truth, probabilistic, or plausibility evaluations. Additionally, no private information is compromised during the entire procedure. A full on-board unit software stack that reflects the behavior of zk-PoT is implemented within a specifically designed simulator called Flowsim. A comprehensive experimental analysis is then conducted using synthesized city-scale simulations, which demonstrates that zk-PoT’s cross-verification ratio ranges between 80 % to 96 %, and 90 % of the verification is achieved in 5 s, with a protocol overhead of approximately 25 %. Furthermore, the analyses of various attacks indicate that most of the attacks could be prevented, and some, such as collusion attacks, can be mitigated. The proposed approach can be incorporated into existing works, including the European Telecommunications Standards Institute (ETSI) and the International Organization for Standardization (ISO) ITS standards, without disrupting the backward compatibility.
Sachi Chaudhary, Shail N. Shah, Riya Kakkar, Rajesh Gupta · 8 authors
Purpose: With the advancement and modernization of Information and Communication Technology, electronic voting (e-voting) has been adopted across the globe for conducting a secure and efficient voting procedure. However, e-voting can be easily exposed to various malicious attacks such as denial-of-service, malware, insider, compromised credentials, etc., that can risk the voter’s privacy and affect the final voting results. Thus, we have considered the decentralized and immutable blockchain technology for completing the voting procedure securely. Nevertheless, many researchers have considered blockchain to mitigate the security and privacy issues of the voting procedure, but they ignored the aspect of cost-efficiency, latency, and response time while voting. Method: The idea of the proposed mechanism is to deploy and implement the smart contract in the Remix Integrated Development Environment (IDE) involving number of voters electing the candidate with various functionalities. Moreover, we considered the amalgamation of blockchain and IPFS to overcome the data storage cost issues of blockchain for voters and candidates communicating through 5G wireless network. The 5G network, with its low latency, high availability, and high reliability facilitates high data rate and reliable communication between voters and candidates to complete the voting procedure efficiently. Results: The deployed smart contract of the proposed voting mechanism highlight various functionalities required for electing the candidate by the voters. Moreover, the deployed smart contract is evaluated and analyzed considering various performance metrics such as gas consumption analysis for smart contract functions and number of voters, cost analysis for smart contract functions, bit error rate, and storage cost comparison with the traditional scheme. We have also verified the security of the proposed voting mechanism using Echidna security tool which shows the election of candidate without any threat. Conclusion: Finally, we have presented a blockchain-based voting mechanism in which IPFS and 5G is employed to avail the cost-efficient, reliable, and secure candidate election by the voters. Moreover, the voters and candidates can communicate with lower response time and high reliability using 5G network so that smart contract consisting of all the functionalities related to the candidate election can be executed efficiently in the Remix IDE.
Jingya Dong, Chunhe Song, Yong Sun, Tao Zhang
Blockchain, which originated with the Bitcoin system, has drawn intense attention because of its decentralization, persistence, and anonymity. The execution environment of blockchain is isolated from the external world and requires "blockchain oracles": agents that fetch information from the out-side world. However, there is always the risk of oracles providing corrupt, malicious, or inaccurate data. To overcome this issue, this paper analyses the existing oracle working patterns, then introduces a decentralized autonomous oracle network (DAON) and its consensus protocol and noninteractive reputation maintenance and payment scheme. Meanwhile, the reputation and security monitoring services of DAON are designed to ensure the DAON provide trustworthy data services in a complex byzantine environment. The proposed method is verified by experiments on three applications. Using the proposed network, smart contracts on future blockchains could have reliable, tamper-proof inputs and outputs.