Follow blockchain research across journals, conferences, and preprint repositories.
3,460 results · page 58 of 145
Francisco Moya, Francisco J. Quesada, Luis Martı́nez, Fco Javier Estrella
No abstract is available for this record.
Emanuele Giunta
No abstract is available for this record.
B. Subashini, D. Hemavathi
Due to an increase in agricultural mislabeling and carelesshandling of non-perishable foods in recent years, consumers have been calling for the food sector to be more transparent. Due to information dispersion between divisions and the propensity to record inaccurate data, current traceability solutions typically fail to provide reliable farm-to-fork histories ofproducts. The three most enticing characteristics of blockchain technology areopenness, integrity, and traceability, which make it a potentially crucial tool for guaranteeing the integrity and correctness of data. In this paper, we suggest a permissioned blockchain system run by organizations, such as regulatory bodies, to promote the origin-tracking of shelf-stable agricultural products. We propose a four-tiered architecture, parallel side chains, Zero-Knowledge Proofs (ZKPs), and Interplanetary File Systems (IPFS). These ensure that information about where an item came from is shared, those commercial competitors cannot get to it, those big storage problems are handled, and the system can be scaled to handle many transactions at once. Thesolution maintains the confidentiality of all transaction flows whenprovenance data is queried utilizing smart contracts and a consumer-grade reliance rate. Extensive simulation testing using Ethereum Rinkeby and Polygon demonstrates reduced execution time, latency, and throughput overheads.
Emanuele Scala, Leonardo Mostarda
No abstract is available for this record.
Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi · 6 authors
Zero-knowledge Succinct Non-interactive ARguments of Knowledge (zkSNARKs) are becoming an increasingly fundamental tool in many real-world applications where the proof compactness is of the utmost importance, including blockchains. A proof of security for SNARKs in the Universal Composability (UC) framework (Canetti, FOCS’01) would rule out devastating malleability attacks. To retain security of SNARKs in the UC model, one must show their simulation-extractability such that the knowledge extractor is both black-box and straight-line , which would imply that proofs generated by honest provers are non-malleable . However, existing simulation-extractability results on SNARKs either lack some of these properties, or alternatively have to sacrifice witness succinctness to prove UC security. In this paper, we provide a compiler lifting any simulation-extractable NIZKAoK into a UC-secure one in the global random oracle model, importantly, while preserving the same level of witness succinctness. Combining this with existing zkSNARKs, we achieve, to the best of our knowledge, the first zkSNARKs simultaneously achieving UC-security and constant sized proofs.
Raju Halder, Md. Imran Alam, Akshay M. Fajge, Neeraj Kumar Singh · 5 authors
No abstract is available for this record.
Jing Deng, Xiaofei Xing, Guoqiang Deng, Ning Hu · 7 authors
As one of the major threats to the current DeFi (Decentralized Finance) ecosystem, reentrant attack induces data inconsistency of the victim smart contract, enabling attackers to steal on-chain assets from DeFi projects, which could terribly do harm to the confidence of the blockchain investors. However, protecting DeFi projects from the reentrant attack is very difficult, since generating a call loop within the highly automatic DeFi ecosystem could be very practicable. Existing researchers mainly focus on the detection of the reentrant vulnerabilities in the code testing, and no method could promise the non-existent of reentrant vulnerabilities. In this paper, we introduce the database lock mechanism to isolate the correlated smart contract states from other operations in the same contract, so that we can prevent the attackers from abusing the inconsistent smart contract state. Compared to the existing resolutions of front-running, code audit, and modifier, our method guarantees protection results with better flexibility. And we further evaluate our method on a number of de facto reentrant attacks observed from Etherscan. The results prove that our method could efficiently prevent the reentrant attack with less running cost.
Miaomiao Wang, Lanlan Rui, Siya Xu, Zhipeng Gao · 6 authors
No abstract is available for this record.
Prakhyat Khati, Ajay Kumar Shrestha, Julita Vassileva
In this paper, we propose a certificate sharing system based on blockchain that gives students authority and control over their academic certificates. Our strategy involves developing blockchain-based NFT certifications that can be shared with institutions or employers using blockchain addresses. Students may access the data created by each individual institute in a single platform, filter the view of the relevant courses according to their requirements, and mint their certificate metadata as NFTs. This method provides accountability of access, comprehensive records that are permanently maintained in IPFS, and verifiable provenance for creating, distributing, and accessing certificates. It also makes it possible to share certificates more safely and efficiently. By incorporating trust factors through data provenance, our system provides a countermeasure against issues such as fake and duplicate certificates. It addresses the challenge of the traditional certificate verification processes, which are lengthy manual process. With this system, students can manage and validate their academic credentials from multiple institutions in one location while ensuring authenticity and confidentiality using digital signatures and hashing for data protection against unauthorized access. Overall, our suggested system ensures data safety, accountability, and confidentiality while offering a novel approach to certificate distribution.
Soroush Farokhnia
Smart contracts are programs that are executed on the blockchain and can hold, manage and transfer assets in the form of cryptocurrencies. The contract's execution is then performed on-chain and is subject to consensus, i.e. every node on the blockchain network has to run the function calls and keep track of their side-effects. In most programmable blockchains, such as Ethereum, the notion of gas is introduced to prevent DoS attacks by malicious parties who might try to slow down the network by performing heavy computations. A fixed cost to each atomic operation, and the initiator of a function call pays the total gas cost as a transaction fee. This helps prevent DoS attacks, but the resulting fees are extremely high. For example, in 2022, on Ethereum alone, there has been a total gas usage of 1.77 Million ETH ~ 4.3 Billion USD. This thesis proposes "lazy contracts" as a solution to alleviate these costs. Our solution moves most of the computation off-chain, ensuring that each function call incurs only a tiny amount of gas usage, while preserving enough data on-chain to guarantee an implicit consensus about the state of the contract variables and ownership of funds. A complete on-chain execution of the functions will only be triggered in case two parties to the contract are in disagreement about the current state, which in turn can only happen if at least one party is dishonest. In such cases, our protocol can identify the dishonest party and penalize them by having them pay for the entire gas usage. Hence, no rational party has an incentive to act dishonestly. Finally, we perform extensive experiments over 160,735 real-world Solidity contracts that were involved in 9,055,492 transactions in January 2022--January 2023 on Ethereum and show that our approach reduces the overall gas usage by 55.4%, which amounts to an astounding saving of 109.9 Million USD in gas fees.
Balaźs Ádám Toldi, Imre Kocsis
Business process collaboration between independent parties is challenging when participants do not completely trust each other. Tracking actions and enforcing the activity authorizations of participants via blockchain-hosted smart contracts is an emerging solution to this lack of trust, with most state-of-the-art approaches generating the orchestrating smart contract logic from Business Process Model and Notation (BPMN) models. However, compared to centralized business process orchestration services, smart contract state typically leaks potentially sensitive information about the state of the collaboration, limiting the applicability of decentralized process orchestration. This paper presents a novel, collaboration confidentiality-preserving approach where the process orchestrator smart contract only stores encrypted and hashed process states and validates participant actions against a BPMN model using zero-knowledge proofs. We cover a subset of BPMN, which is sufficient from the practical point of view, support messagepassing between participants, and provide an open-source, endto-end prototype implementation that automatically generates the key software artifacts.
Rohan Manoj, Sandeep Joshi
With the advancements in technology, blockchain systems have seen widespread use and rapid growth in the field of data security and verification. Blockchain is used in a variety of applications, including financial transactions, healthcare, insurance, Internet of Things, education, and many more, with the promise of increased skills and resilience. This smart distributed peer-to-peer design drew interest from a variety of businesses and communities outside the financial sphere. The major focus of the proposed work is on security challenges and limitations of Ethereum-based smart contracts. Ethereum smart contract is vulnerable to reentrancy security attack. The proposed work analyze reentrancy attacks and assess countermeasures to dissuade vulnerabilities on the network.
Mohsin Imam
No abstract is available for this record.
K. Sahitya Yadav, Smita Naval
No abstract is available for this record.
Shahla Atapoor, Karim Baghery, Daniele Cozzo, Robi Pedersen
No abstract is available for this record.
Miquel À. Cabot-Nadal, Macià Mut–Puigserver, M. Magdalena Payeras–Capellà, Rosa Pericàs-Gornals
Blockchain technology can be used in several e-commerce applications, like the creation of certified notifications. This kind of service allows a user, which acts as the sender, to prove that he has sent some data to a receiver. With the use of blockchain technology, we can take advantage of the fact that it offers a transparent and decentralized way to certify the authenticity and integrity of notifications. In this proposal, we combine the use of Soulbound tokens (SBTs), a special kind of Non-Fungible Tokens (NFTs) whose owners cannot transfer or trade to other users, with an improvement of the ERC-721 standard to include the possibility that the receiver could reject a token, allowing the selective reception of SBTs. Representing the certified notifications as Rejectable SBTs (RejSBT), we can track when the sender sends a notification, and when the receiver accepts it, providing both non-repudiation of origin (NRO) and reception (NRR) proofs. The notification process require only two steps. Once the receiver has accepted the RejSBT that represents the ownership of a notification, we will use Identity-Based Cryptography to let the owner decrypt the confidential information represented by the RejSBT.
Dario Catalano, Dario Fiore, Emanuele Giunta
No abstract is available for this record.
S. Naveena, Smarajit Bose, D. Immanual Gilwax Prabhu, T Anitha · 5 authors
No abstract is available for this record.
Siddhant Reddy, Dharmender Singh Kushwaha
This paper proposes a framework for privacy-preserving credential issuance and verification over the public blockchain. The credential used in this framework is a soulbound token (SBT), a non-transferrable non-fungible token (NFT) verifiable on the blockchain. Once the issuing organization issues the credential, this framework gives the holder complete control of the credential. This privacy-preserving property allows the holder to selectively disclose the credential attributes in the verification process. The framework proposed suggests a decentralized credential recovery mechanism if the credential holder loses their private key. This paper compares this framework’s efficiency with different schemes based on privacy-preserving, selective disclosure, and decentralized credential recovery. This paper also compares the overhead for credential issuance and verification with Merkle trees. This paper also discusses the real-world use cases where this framework can be applied.
Emanuele Scala, Changyu Dong, Flavio Corradini, Leonardo Mostarda
No abstract is available for this record.
Gongxian Zeng, Junzuo Lai, Zhengan Huang, Linru Zhang · 8 authors
No abstract is available for this record.
Robert Muth, Tarek Galal, Jonathan Heiss, Florian Tschorsch
No abstract is available for this record.
Dylan Yu, Yi‐Chen E. Yang, Alissa Shen, Dan E. Tamir · 5 authors
No abstract is available for this record.
Yash Jaiswal, Ayushi Maurya, Ashok Kumar Yadav, Arun Kumar
No abstract is available for this record.