In traditional cloud computing system, searchable encryption is deemed as a core technology to realize data confidentiality protection and information retrieval functions. However, the online payment problem and mutual distrust between cloud platforms and users may hinder the wide adoption of cloud service. In this paper, we construct a blockchain based multi-keyword ranked search with fair payment (BMFP) system, which leverages smart contracts to verify the correctness and completeness of the search result, and automatically execute the fair payment operations. The system realizes public verifiability on a multi-keyword ranked search result. The data owner manages the search authority, and a concrete fair payment smart contract is designed. The BMFP is compatible with Ethereum, and the verification algorithm executed by the smart contract is cost-efficient.
Resource sharing among vehicles can highly improve the capability and efficiency of Internet of Vehicles (IoV). However, it is challenging to establish trust and preserve privacy during the resource sharing process because of the high mobility and topological variability in IoV. Emerging blockchain technology expresses the excellent performance in handling distributed trust due to its verifiable and immutable ledger. In this paper, we first propose a consortium blockchain-based resource sharing paradigm in IoV, in which the resource sharing interactions are encapsulated as transactions and recorded by Road Side Units (RSUs). Moreover, a lightweight consensus mechanism named as Proof-of-Reputation is proposed to reduce computational power consumption and motivate vehicles involved in resource sharing. Finally a differentiated resource pricing scheme is proposed based on the dynamic match game of resource demand and supply. The reputation value is designed to indicate the trustworthy degree of vehicles, and the trust is established via the consensus procedure. We couple the resource sharing process and consensus together by utilizing the reputation value of each vehicle. The security and privacy analysis as well as simulation experiments on communication performance can verify the efficiency of the proposed blockchain system.
Telemedicine offers a medical-on-demand (MoD) service from a distance. This technology is designed to overcome distance barriers and improve the process of accessing medical services in distant rural communities. With the development of cloud computing, the MoD services in the telemedicine system are provided by the Cloud Service Provider (CSP). This CSP connects the patient and the medical staff in different places with both convenience and fidelity. Meanwhile, the outsourcing healthcare data on public cloud platforms bring some new challenges on the security. Although attribute-based encryption (ABE) algorithm realizes flexible and fine-grained access control, a large number of patients subscribe or unsubscribe the different medical services frequently in the cloud, which takes a huge cost for membership management. In this paper, an ABE scheme is presented to achieve the dynamic authentication and authorization with higher flexibility and efficiency for the MoD services in telemedicine system. On the one hand, when the patient alters his ordered service, it requires no updating on the parameters for those whose statuses remain unchanged. We construct an independent-update key policy ABE scheme in the distributed telemedicine system that aims to updates patient's keys separately, and there are multiple authorities to manage this system altogether which is more similar to the real situation. On the other hand, by using blockchain and distributed database technologies, the private healthcare data stored in public cloud is protected in integrity, which avoids the misdiagnosis accident from the inaccurate electronic health records distorted by a malicious user or authority from the inner cloud. Finally, we analyze the collusion attack in multiple authorities and formally prove the security of this protocol in a standard model. After comparing and simulating, the results of this work show a better performance.
In enterprise business applications, large volumes of data are generated daily, encoding business logic and transactions. Those applications are governed by various compliance requirements, making it essential to provide audit logs to store, track, and attribute data changes. In traditional audit log systems, logs are collected and stored in a centralized medium, making them prone to various forms of attacks and manipulations, including physical access and remote vulnerability exploitation attacks, and eventually allowing for unauthorized data modification, threatening the guarantees of audit logs. Moreover, such systems, and given their centralized nature, are characterized by a single point of failure. To harden the security of audit logs in enterprise business applications, in this work we explore the design space of blockchain-driven secure and transparent audit logs. We highlight the possibility of ensuring stronger security and functional properties by a generic blockchain system for audit logs, realize this generic design through BlockAudit, which addresses both security and functional requirements, optimize BlockAudit through multi-layered design in BlockTrail, and explore the design space further by assessing the functional and security properties the consensus algorithms through comprehensive evaluations. The first component of this work is BlockAudit, a design blueprint that enumerates structural, functional, and security requirements for blockchain-based audit logs. BlockAudit uses a consensus-driven approach to replicate audit logs across multiple application peers to prevent the single-point-of-failure. BlockAudit also uses the Practical Byzantine Fault Tolerance (PBFT) protocol to achieve consensus over the state of the audit log data. We evaluate the performance of BlockAudit using event-driven simulations, abstracted from IBM Hyperledger. Through the performance evaluation of BlockAudit, we pinpoint a need for high scalability and high throughput. We achieve those requirements by exploring various design optimizations to the flat structure of BlockAudit inspired by real-world application characteristics. Namely, enterprise business applications often operate across non-overlapping geographical hierarchies including cities, counties, states, and federations. Leveraging that, we applied a similar transformation to BlockAudit to fragment the flat blockchain system into layers of codependent hierarchies, capable of processing transactions in parallel. Our hierarchical design, called BlockTrail, reduced the storage and search complexity for blockchains substantially while increasing the throughput and scalability of the audit log system. We prototyped BlockTrail on a custom-built blockchain simulator and analyzed its performance under varying transactions and network sizes demonstrating its advantages over BlockAudit. A recurring limitation in both BlockAudit and BlockTrail is the use of the PBFT consensus protocol, which has high complexity and low scalability features. Moreover, the performance of our proposed designs was only evaluated in computer simulations, which sidestepped the complexities of the real-world blockchain system. To address those shortcomings, we created a generic cloud-based blockchain testbed capable of executing five well-known consensus algorithms including Proof-of-Work, Proof-of-Stake, Proof-of-Elapsed Time, Clique, and PBFT. For each consensus protocol, we instrumented our auditing system with various benchmarks to measure the latency, throughput, and scalability, highlighting the trade-off between the different protocols.
Proof-of-burn has been used as a mechanism to destroy cryptocurrency in a verifiable manner. Despite its well known use, the mechanism has not been previously formally studied as a primitive. In this paper, we put forth the first cryptographic definition of what a proof-of-burn protocol is. It consists of two functions: First, a function which generates a cryptocurrency address. When a user sends money to this address, the money is irrevocably destroyed. Second, a verification function which checks that an address is really unspendable. We propose the following properties for burn protocols. Unspendability, which mandates that an address which verifies correctly as a burn address cannot be used for spending; binding, which allows associating metadata with a particular burn; and uncensorability, which mandates that a burn address is indistinguishable from a regular cryptocurrency address. Our definition captures all previously known proof-of-burn protocols. Next, we design a novel construction for burning which is simple and flexible, making it compatible with all existing popular cryptocurrencies. We prove our scheme is secure in the Random Oracle model. We explore the application of destroying value in a legacy cryptocurrency to bootstrap a new one. The user burns coins in the source blockchain and subsequently creates a proof-of-burn, a short string proving that the burn took place, which she then submits to the destination blockchain to be rewarded with a corresponding amount. The user can use a standard wallet to conduct the burn without requiring specialized software, making our scheme user friendly. We propose burn verification mechanisms with different security guarantees, noting that the target blockchain miners do not necessarily need to monitor the source blockchain. Finally, we implement the verification of Bitcoin burns as an Ethereum smart contract and experimentally measure that the gas costs needed for verification are as low as standard Bitcoin transaction fees, illustrating that our scheme is practical.
SUMMARY Blockchain is a disruptive technology that offers advantages to the audit profession such as transparency into all transactions, an immutable ledger, and the potential for real-time auditing. However, to realize these benefits, the profession must be prepared to gain comfort over blockchains as a component of organizations' information technology infrastructure. This paper considers risks to private and permissioned blockchains through the lens of information technology general controls (ITGCs) as part of an audit of internal control over financial reporting. I discuss new ITGC areas of focus for auditors to consider, along with areas of risk that blockchain could eliminate. To help readers better understand this emerging topic, I provide illustrations, a summary table of key points, and a glossary of blockchain-related terms used throughout the paper. This paper should be viewed as a primer of ITGC considerations on blockchain audits, as more nuanced concerns will emerge as the technology evolves.
The future of distributed ledger technology such as blockchain is dependent on its ability to interact and integrate with other systems. Therefore, interoperability has become a fundamental issue that needs to be addressed. The emerging category of crypto-assets are managed and understood using different frameworks. There is, therefore, a need for a unified classification of crypto-assets. This work aims to bring some clarity to and understanding on interoperable crypto-assets and their characteristics. This paper categorizes digital crypto-assets for the purpose of implementing interoperability. The categorization of crypto-assets is based on their functionalities and their purpose. An interoperability scenario has been given for the defined crypto-asset classes.
Deepak Puthal, Saraju P. Mohanty, Priyadarsi Nanda, Elias Kougianos · 5 authors
Resource -constrained distributed systems such as the Internet of Things (IoT), edge computing and fog computing are deployed for real-time monitoring and evaluation. Current security solutions are problematic when there is a centralized controlling entity. The blockchain provides decentralized security architectures using proof-of-work (PoW). Proof-of-work is an expensive process for IoT and edge computing due to the deployment of resource-constrained devices. This paper presents a novel consensus algorithm called Proof-of-Authentication (PoAh) to replace Proof-of-Work and introduce authentication in such environments to make the blockchain application-specific. This paper implemented the Proof-of-Authentication system to evaluate its sustainability and applicability for the IoT and edge computing. The evaluation process is conducted in both simulation and real-time testbeds to evaluate performance. Finally, the process of Proof-of-Authentication and its integration with blockchain in resource-constrained distributed systems is discussed. Our proposed PoAh, while running in limited computer resources (e.g. single-board computing devices like the Raspberry Pi) has a latency in the order of 3 secs.
This work presents ContractChecker, a Blockchain-based security protocol for verifying the storage consistency between the mutually distrusting cloud provider and clients. Unlike existing protocols, the ContractChecker uniquely delegates log auditing to the Blockchain, and has the advantages in reducing client cost and lowering requirements on client availability, lending itself to modern scenarios with mobile and web clients. The ContractChecker collects the logs from both clients and the cloud server, and verifies the consistency by cross-checking the logs. By this means, it does not only detects the attacks from malicious clients and server forging their logs, but also is able to mitigate those attacks and recover the system from them. In addition, we design new attacks against ContractChecker exploiting various limits in real Blockchain systems (e.g., write unavailability, Blockchain forks, contract race conditions). We analyze and harden the security of ContractChecker protocols against the proposed new attacks. For evaluating the cost, we build a functional prototype of the ContractChecker on Ethereum/Solidity. By experiments on private and public Ethereum testnets, we extensively evaluate the cost of the ContractChecker in comparison with that of existing client-based log auditing works. The result shows the ContractChecker can scale to hundreds of clients and save client costs by more than one order of magnitude.
Blockchain is experiencing rapid development and has the full potential of revolutionizing the IoT platform in the industrial field. In this paper, a light-weighted Blockchain-based platform for IIoT is presented to address security, trust, and island connection problem in the process of IIoT ecosystem construction. BPIIoT is comprised of the on-chain network and the off-chain network. All transactions are processed in the on-chain network such as including digital signature based on access control and programmable permission. The off-chain network deals with the storage, complex data processing, and other problems that blockchain cannot solve. The smart contract is utilized as the service contract of consumers and manufacture resources, providing on-demand manufacturing service. Two smart application cases, manufacturing equipment data sharing and maintenance service sharing from smart manufacturing, are implemented to explain the smart contract for equipment maintenance service and status data sharing service throughout maintenance, repair, and operation service network by the BPIIoT.
Mary Maller, Sean Bowe, Markulf Kohlweiss, Sarah Meiklejohn
Ever since their introduction, zero-knowledge proofs have become an important tool for addressing privacy and scalability concerns in a variety of applications. In many systems each client downloads and verifies every new proof, and so proofs must be small and cheap to verify. The most practical schemes require either a trusted setup, as in (pre-processing) zk-SNARKs, or verification complexity that scales linearly with the complexity of the relation, as in Bulletproofs. The structured reference strings required by most zkSNARK schemes can be constructed with multi-party computation protocols, but the resulting parameters are specific to an individual relation. Groth et al. discovered a zk-SNARK protocol with a universal structured reference string that is also updatable, but the string scales quadratically in the size of the supported relations.<br/> <br/>Here we describe a zero-knowledge SNARK, Sonic, which supports a universal and continually updatable structured reference string that scales linearly in size. We also describe a generally useful technique in which untrusted “helpers” can compute advice that allows batches of proofs to be verified more efficiently. Sonic proofs are constant size, and in the “helped” batch verification context the marginal cost of verification is comparable with the most efficient SNARKs in the literature<br/>
Building Information Modeling (BIM) is envisioned as an indispensable opportunity in the architecture, engineering, and construction (AEC) industries as a revolutionary technology and process. Smart construction relies on BIM for manipulating information flow, data flow, and management flow. Currently, BIM model has been explored mainly for information construction and utilization, but rare works pay efforts to information security, e.g., critical model audit and sensitive model exposure. Moreover, few BIM systems are proposed to chase after upcoming computing paradigms, such as mobile cloud computing, big data, blockchain, and Internet of Things. In this paper, we make the first attempt to propose a novel BIM system model called bcBIM to tackle information security in mobile cloud architectures. More specifically, bcBIM is proposed to facilitate BIM data audit for historical modifications by blockchain in mobile cloud with big data sharing. The proposed bcBIM model can guide the architecture design for further BIM information management system, especially for integrating BIM cloud as a service for further big data sharing. We propose a method of BIM data organization based on blockchains and discuss it based on private and public blockchain. It guarantees to trace, authenticate, and prevent tampering with BIM historical data. At the same time, it can generate a unified format to support future open sharing, data audit, and data provenance.
Achieving data integrity verification for large-scale IoT data in cloud storage safely and efficiently has become one of the hot topics with further applications of Internet of Things. Traditional data integrity verification methods generally use encryption techniques to protect data in the cloud, relying on trusted Third Party Auditors (TPAs). Blockchain based data integrity schemes can successfully avoid the trust problem of TPAs, however, they have to face the problems of large computational and communication overhead. To address the issues above, we propose a Blockchain and Bilinear mapping based Data Integrity Scheme (BB-DIS) for large-scale IoT data. In our BB-DIS, IoT data is sliced into shards and homomorphic verifiable tags (HVTs) are generated for sampling verification. Data integrity can be achieved according to the characteristics of bilinear mapping in the form of blockchain transactions. Performance analysis of BB-DIS including feasibility, security, dynamicity and complexity is also discussed in detail. A prototype system of BB-DIS is then presented to illustrate how to implement our verification scheme. Experimental results based on Hyperledger Fabric demonstrate that the proposed verification scheme significantly improves the efficiency of integrity verification for large-scale IoT data with no need of TPAs.
Michael Borkowski, Marten Sigwart, Philipp Frauenthaler, Taneli Hukkinen · 5 authors
Current blockchain technologies provide very limited interoperability. Restrictions with regard to asset transfers and data exchange between different blockchains reduce the usability and comfort of users, and hinder novel developments within the blockchain space. As a first step towards blockchain interoperability, we propose the DeXTT cross-blockchain transfer protocol, which can be used to record a token transfer on any number of blockchains simultaneously in a decentralized manner. We provide a reference implementation using Solidity, and evaluate its performance. We show logarithmic scalability of DeXTT with respect to the number of participating nodes, and analyze cost requirements of the transferred tokens.
Although the blockchain-based applications are considered to be less vulnerable due to the nature of the distributed ledger, they did not become the silver bullet with respect to securing the information against different security risks. In this paper, we present a literature review on the security risks that can be mitigated by introducing the blockchain technology, and on the security risks that are identified in the blockchain-based applications. In addition, we highlight the application and technology domains where these security risks are observed. The results of this study could be seen as a preliminary checklist of security risks when implementing blockchain-based applications.
This study attempts to create a cryptocurrency classification metod and tool for reliability assessment from the point of view of investors and traders. The definition of the reliability of cryptocurrency and classification criteria is formulated. The following emphasizes how, using the support vector method, based on the available open data, it is possible to determine the reliability of Ethereum-based cryptocurrencies. As a result of testing, 15 reliable cryptocurrencies were identified and software was developed that allows you to collect and classify cryptocurrencies.
Accurate and complete educational records are a valuable asset for people. In recent years, educational records have been digitized. However, there are still two key challenges that have not been resolved. One is to achieve secure and privacy-preserving storage of educational records, while another concern how to realize the sharing of educational records and ensure the security of the sharing process. In this paper, we propose EduRSS, a blockchain-based storage and sharing scheme for educational records is proposed, which combines blockchain, storage servers, and cryptography techniques to create a reliable and safe environment. In our proposal, the blockchain technology is used to ensure the security and reliability of data storage, while the smart contracts on the blockchain are used to regulate the process of storage and sharing. More precisely, the off-chain storage servers store the original educational records in encrypted form, while the hash information of the records is stored on the blockchain. The off-chain records are anchored periodically with the hash information on the blockchain to ensure the security of data storage. Cryptography techniques are utilized to handle records encryption and messages digital signature. To assess the effectiveness of EduRSS, we designed and tested a proof of concept of this scheme. The relative security analysis shows that EduRSS is safe and has a lower computational cost than that of the CP-ABE and the MA-CPABE schemes.
In traditional electronic health records (EHRs), medical-related information is generally separately controlled by different hospitals and thus it leads to the inconvenience of information sharing. Cloud-based EHRs solve the problem of information sharing in the traditional EHRs. However, cloud-based EHRs suffer the centralized problem, i.e., cloud service center and key-generation center. This paper works on creating a new EHRs paradigm which can help in dealing with the centralized problem of cloud-based EHRs. Our solution is to make use of the emerging technology of blockchain to EHRs (denoted as blockchain-based EHRs for convenience). First, we formally define the system model of blockchain-based EHRs in the setting of consortium blockchain. In addition, the authentication issue is very important for EHRs. However, existing authentication schemes for blockchain-based EHRs have their own weak points. Therefore, in this paper, we also propose an authentication scheme for blockchain-based EHRs. Our proposal is an identity-based signature scheme with multiple authorities which can resist collusion attack out of N from N-1 authorities. Furthermore, our scheme is provably secure in the random oracle model and has more efficient signing and verification algorithms than existing authentication schemes of blockchain-based EHRs.
David Derler, Kai Samelin, Daniel Slamanig, Christoph Striecks
Blockchain technologies recently received a considerable amount of attention. While the initial focus was mainly on the use of blockchains in the context of cryptocurrencies such as Bitcoin, application scenarios now go far beyond this. Most blockchains have the property that once some object, e.g., a block or a transaction, has been registered to be included into the blockchain, it is persisted and there are no means to modify it again. While this is an essential feature of most blockchain scenarios, it is still often desirable-at times it may be even legally required-to allow for breaking this immutability in a controlled way.
Proof-of-stake blockchain protocols are becoming one of the most promising alternatives to the energy-consuming proof-of-work protocols. However, one particularly critical threat in the PoS setting is the well-known long-range attacks caused by secret key leakage (LRSL attack). Specifically, an adversary can attempt to control/compromise accounts possessing substantial stake at some past moment such that double-spend or erase past transactions, violating the fundamental persistence property of blockchain. Puncturable signatures provide a satisfying solution to construct practical proof-of-stake blockchain resilient to LRSL attack, despite of the fact that existent constructions are not efficient enough for practical deployments.
In this paper, we provide an in-depth study of puncturable signatures and explore its applications in the proof-of-stake blockchain. We formalize a security model that allows the adversary for adaptive signing and puncturing queries, and show a construction with efficient puncturing operations based on the Bloom filter data structure and strong Diffie-Hellman assumption. The puncturing functionality we desire is for a particular part of message, like prefix, instead of the whole message. Furthermore, we use puncturable signatures to construct practical proof-of-stake blockchain protocols that are resilient to LRSL attack, while previously the forward-secure signature is used to immunize this attack. We implement our scheme and provide experimental results showing that in comparison with the forward-secure signature, our construction performs substantially better on signature size, signing and verification efficiency, significantly on key update efficiency.
Antoine Durand, Emmanuelle Anceaume, Romaric Ludinard
Our work focuses on the design of a scalable permissionless blockchain in the proof-of-stake setting. In particular, we use a distributed hash table as a building block to set up randomized shards, and then leverage the sharded architecture to validate blocks in an efficient manner. We combine verifiable Byzantine agreements run by shards of stakeholders and a block validation protocol to guarantee that forks occur with negligible probability. We impose induced churn to make shards robust to eclipse attacks, and we rely on the UTXO coin model to guarantee that any stakeholder action is securely verifiable by anyone. Our protocol works against adaptive adversary, and makes no synchrony assumption beyond what is required for the byzantine agreement.
Now more and more data are being outsourced to cloud services. In order to ensure data security and privacy, data are usually stored on the cloud server in the form of ciphertext. When a user requests access to the encrypted data, an access key distributed by a third party is needed. However, if the third party is dishonest, the security of the system will be threatened. Faced with this problem, in this paper, we propose a new secure cloud storage framework with access control by using the Ethereum blockchain technology. Our new scheme is a combination of Ethereum blockchain and ciphertext-policy attribute-based encryption (CP-ABE). The proposed cloud storage framework is decentralized, that is, there is no trusted third party in the system. Our scheme has three main features. First, as the Ethereum blockchain technology is used, the data owner can store ciphertext of data through smart contracts in a blockchain network. Second, the data owner can set valid access periods for data usage so that the ciphertext can only be decrypted during valid access periods. Finally, as the creation and invocation of each smart contract can be stored in the blockchain, thus, the function of the trace is achieved. The analysis of the security and experiment shows that our scheme is feasible.
Yong Wang, Aiqing Zhang, Peiyun Zhang, Huaqun Wang
The sharing of electronic health records (EHRs) has great positive significance for research of disease and doctors' diagnosis. In recent years, cloud-based electronic medical record sharing scheme has brought a lot of conveniences, but the centralization of cloud exposes threats inevitably to data security and privacy preservation. Blockchain technology can be seen as a promising solution to address these problems on account of its unique propertis of decentration, anonymity, unforgeability and verifiability. In this paper, we propose a blockchain based secure and privacy-preserving EHR sharing protocol. Data requester can search desired keyword from data provider to find relevant EHRs on the EHR consortium blockchain and get the re-encryption ciphertext from cloud server after getting the data owner's authorization. The scheme mainly uses searchable encryption and conditional proxy re-encryption to realize data security, privacy preservation, and access control. Furthermore, proof of authorization is designed as the consensus mechanism for consortium blockchain to guarantee system's availability. Security analysis demonstrates that the proposed protocol can achieve security goals. Besides, we emulate the cryptographic primitives and implement the proposed scheme on Ethereum platform. Performance evaluation shows that the proposed scheme has high computational efficiency.