Blockchain Papers

Madars Virza

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.

Jonatan Bergquist

The purpose of this Master's thesis is to explore blockchain technology and smart contracts as a way of building privacy-sensitive applications. The main focus is on a medication plan containing prescriptions, built on a blockchain system of smart contracts. This is an example use case, but the results can be transferred to other ones where sensitive data is being shared and a proof of validity or authentication is needed. First the problem is presented, why medication plans are in need of digitalisation and why blockchain technology is a fitting technology for implementing such an application. Then blockchain technology is explained, since it is a very new and relatively unfamiliar IT construct. Thereafter, a design is proposed for solving the problem. A system of smart contracts was built to prove how such an application can be built, and suggested guidelines for how a blockchain system should be designed to fulfil the requirements that were defined. Finally, a discussion is held regarding the applicability of different blockchain designs to the problem of privacy-handling applications.

Thanh Bui, Tuomas Aura

Blockchains and other public ledger structures promise a new way to create globally consistent event logs and other records. We make use of this consistency property to detect and prevent man-in-the-middle attacks in a key exchange such as Diffie-Hellman or ECDH. Essentially, the MitM attack creates an inconsistency in the world views of the two honest parties, and they can detect it with the help of the ledger. Thus, there is no need for prior knowledge or trusted third parties apart from the distributed ledger. To prevent impersonation attacks, we require user interaction. It appears that, in some applications, the required user interaction is reduced in comparison to other user-assisted key-exchange protocols.

Benedikt Bünz, Jonathan Bootle, Dan Boneh, Andrew Poelstra · 6 authors

We propose Bulletproofs, a new non-interactive zero-knowledge proof protocol with very short proofs and without a trusted setup; the proof size is only logarithmic in the witness size. Bulletproofs are especially well suited for efficient range proofs on committed values: they enable proving that a committed value is in a range using only 2 log_2(n)+9 group and field elements, where n is the bit length of the range. Proof generation and verification times are linear in n. Bulletproofs greatly improve on the linear (in n) sized range proofs in existing proposals for confidential transactions in Bitcoin and other cryptocurrencies. Moreover, Bulletproofs supports aggregation of range proofs, so that a party can prove that m commitments lie in a given range by providing only an additive O(log(m)) group elements over the length of a single proof. To aggregate proofs from multiple parties, we enable the parties to generate a single proof without revealing their inputs to each other via a simple multi-party computation (MPC) protocol for constructing Bulletproofs. This MPC protocol uses either a constant number of rounds and linear communication, or a logarithmic number of rounds and logarithmic communication. We show that verification time, while asymptotically linear, is very efficient in practice. The marginal cost of batch verifying 32 aggregated range proofs is less than the cost of verifying 32 ECDSA signatures. Bulletproofs build on the techniques of Bootle et al. (EUROCRYPT 2016). Beyond range proofs, Bulletproofs provide short zero-knowledge proofs for general arithmetic circuits while only relying on the discrete logarithm assumption and without requiring a trusted setup. We discuss many applications that would benefit from Bulletproofs, primarily in the area of cryptocurrencies. The efficiency of Bulletproofs is particularly well suited for the distributed and trustless nature of blockchains. The full version of this article is available on ePrint.

Alexander Egberts

No abstract is available for this record.

Cristina Pérez‐Solà, Sergi Delgado-Segura, Guillermo Navarro‐Arribas, Jordi Herrera‐Joancomartí

Zero-confirmation transactions, i.e. transactions that have been broadcast but are still pending to be included in the blockchain, have gained attention in order to enable fast payments in Bitcoin, shortening the time for performing payments. Fast payments are desirable in certain scenarios, for instance, when buying in vending machines, fast food restaurants, or withdrawing from an ATM. Despite being quickly propagated through the network, zero-confirmation transactions are not protected against double-spending attacks, since the double-spending protection Bitcoin offers relies on the blockchain and, by definition, such transactions are not yet included in it. In this paper, we propose a double-spending prevention mechanism for Bitcoin zero-confirmation transactions. Our proposal is based on exploiting the flexibility of the Bitcoin scripting language together with a well-known vulnerability of the ECDSA signature scheme to discourage attackers from performing such an attack.

Daniel E. O’Leary

Summary This paper investigates alternative configurations of different blockchain architectures that can be used for gathering and processing transactions in a range of different settings, including accounting, auditing, supply chain and other types of transaction information. Although there has been substantial focus on the peer‐to‐peer and public versions of blockchain, this paper focuses primarily on cloud‐based and private configuration versions of blockchains and investigates use configurations, advantages and limitations as firms bring blockchain‐based market mechanisms into their organizations. In addition, this paper investigates some emerging issues associated with blockchain use in consortium settings. Finally, this paper relates some proposed uses of blockchain for transaction processing to other technologies, such as data warehouses and databases.

Qi Xia, Emmanuel Boateng Sifah, Kwame Omono Asamoah, Jianbin Gao · 6 authors

The dissemination of patients' medical records results in diverse risks to patients' privacy as malicious activities on these records cause severe damage to the reputation, finances, and so on of all parties related directly or indirectly to the data. Current methods to effectively manage and protect medical records have been proved to be insufficient. In this paper, we propose MeDShare, a system that addresses the issue of medical data sharing among medical big data custodians in a trust-less environment. The system is blockchain-based and provides data provenance, auditing, and control for shared medical data in cloud repositories among big data entities. MeDShare monitors entities that access data for malicious use from a data custodian system. In MeDShare, data transitions and sharing from one entity to the other, along with all actions performed on the MeDShare system, are recorded in a tamper-proof manner. The design employs smart contracts and an access control mechanism to effectively track the behavior of the data and revoke access to offending entities on detection of violation of permissions on data. The performance of MeDShare is comparable to current cutting edge solutions to data sharing among cloud service providers. By implementing MeDShare, cloud service providers and other data guardians will be able to achieve data provenance and auditing while sharing medical data with entities such as research and medical institutions with minimal risk to data privacy.

Koteswara Rao Ballamudi

Distributed ledger technology (DLT) that stores data (usually immutable and sequenced transaction records) in a decentralized way through cryptography and consensus algorithms. The first widely recognized implementation of the blockchain took place in 2009 on the Bitcoin public blockchain. Since then, other types of blockchain have been developed for a wide range of applications and features built on common principles such as decentralization, encryption, consensus, and immutability. In particular, blockchain technology is most widely used in transaction settlement and digital currency banks and the financial sector, as well as in supply chain applications that help participants solve problems quickly and efficiently. Other use cases continue to be developed. As a form of information management, blockchain and related DLTs offer advantages over traditional databases and may help develop certain new technologies such as the Internet of Things. Blockchain regulation is currently restricted at the international and federal levels, but state-level legislation provides support and awareness of aspects of blockchain technology. Most of the current regulations are in the form of self-regulation by blockchain developers and related communities, but many challenges and risks such as data privacy and security need to be addressed in the near future.

D. Ragav Prasanth, N SANDEEP, TALLURU CHAITANYA

Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients' data. We present a cooperative PDP (CPDP) scheme based on homomorphic verifiable response and hash index hierarchy. We prove the security of our scheme based on multi-prover zero-knowledge proof system, which can satisfy completeness, knowledge soundness, and zero-knowledge properties. In addition, we also propose a fuzzy clustering system for analyzing the high dimensional Data bases in cloud Environments. This paper proposes novel effective fuzzy soft clustering systems with the combination of possibilistic c-means.

Fan Zhang, Ethan Cecchetti, Kyle Croman, Ari Juels · 5 authors

Smart contracts are programs that execute autonomously on blockchains. Their key envisioned uses (e.g. financial instruments) require them to consume data from outside the blockchain (e.g. stock quotes). Trustworthy data feeds that support a broad range of data requests will thus be critical to smart contract ecosystems.

Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung

Digital signatures are perhaps the most important base for authentication and trust relationships in large scale systems. More specifically, various applications of signatures provide privacy and anonymity preserving mechanisms and protocols, and these, in turn, are becoming critical (due to the recently recognized need to protect individuals according to national rules and regulations). A specific type of signatures called "signatures with efficient protocols", as introduced by Camenisch and Lysyanskaya (CL), efficiently accommodates various basic protocols and extensions like zero-knowledge proofs, signing committed messages, or re-randomizability. These are, in fact, typical operations associated with signatures used in typical anonymity and privacy-preserving scenarios.

Yong Yu, Yannan Li, Man Ho Au, Willy Susilo · 6 authors

No abstract is available for this record.

Roman Beck, Jacob Stenum Czepluch, Nikolaj Lollike, Simon Malone

No abstract is available for this record.

Giuseppe Ateniese, Bernardo Magri, Daniele Venturi, Ewerton R. Andrade

We put forward a new framework that makes it possible to re-write or compress the content of any number of blocks in decentralized services exploiting the blockchain technology. As we argue, there are several reasons to prefer an editable blockchain, spanning from the necessity to remove inappropriate content and the possibility to support applications requiring re-writable storage, to "the right to be forgotten." Our approach generically leverages so-called chameleon hash functions (Krawczyk and Rabin, NDSS '00), which allow determining hash collisions efficiently, given a secret trapdoor information. We detail how to integrate a chameleon hash function in virtually any blockchain-based technology, for both cases where the power of redacting the blockchain content is in the hands of a single trusted entity and where such a capability is distributed among several distrustful parties (as is the case with Bitcoin). We also report on a proof-of-concept implementation of a redactable blockchain, building on top of Nakamoto's Bitcoin core. The prototype only requires minimal changes to the way current client software interprets the information stored in the blockchain and to the current blockchain, block, or transaction structures. Moreover, our experiments show that the overhead imposed by a redactable blockchain is small compared to the case of an immutable one.

Arshdeep Bahga, Vijay K. Madisetti

Internet of Things (IoT) are being adopted for industrial and manufacturing applications such as manufacturing automation, remote machine diagnostics, prognostic health management of industrial machines and supply chain management. Cloud-Based Manufacturing is a recent on-demand model of manufacturing that is leveraging IoT technologies. While Cloud-Based Manufacturing enables on-demand access to manufacturing resources, a trusted intermediary is required for transactions between the users who wish to avail manufacturing services. We present a decentralized, peer-to-peer platform called BPIIoT for Industrial Internet of Things based on the Block chain technology. With the use of Blockchain technology, the BPIIoT platform enables peers in a decentralized, trustless, peer-to-peer network to interact with each other without the need for a trusted intermediary.

Liang-Ao Zhang, Xingming Sun, Zhihua Xia, Qiuju Ji

Attribute-Based Encryption (ABE) is a promising cryptographic primitive to implement access control for secure data storage in the cloud. Since the data owner may frequently change the access policies defined in the ciphertext, it is significant to provide the capacity for dynamic policy updating. However the cloud should also authenticate the owner because the adversary may modify the access policies of the files in the cloud to prevent the legal users from accessing them. In this paper, we focus on the owner's authentication in the ABE systems and propose a novel scheme which enables access control with authenticated dynamic policy updating in the cloud. We adapt the Pedersen commitment and Zero Knowledge Proof of Knowledge (ZKPK) to realize the anonymous authentication of the owner's policy updating key without increasing any secret information to the owner side. The analysis shows that our scheme is authentic and efficient as well as adaptive to different types of access policies.

Eli Ben‐Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer · 5 authors

Non-interactive zero-knowledge proofs (NIZKs) are a powerful cryptographic tool, with numerous potential applications. However, succinct NIZKs (e.g., zk-SNARK schemes) necessitate a trusted party to generate and publish some public parameters, to be used by all provers and verifiers. This party is trusted to correctly run a probabilistic algorithm (specified by the the proof system) that outputs the public parameters, and publish them, without leaking any other information (such as the internal randomness used by the algorithm), violating either requirement may allow malicious parties to produce convincing "proofs" of false statements. This trust requirement poses a serious impediment to deploying NIZKs in many applications, because a party that is trusted by all users of the envisioned system may simply not exist. In this work, we show how public parameters for a class of NIZKs can be generated by a multi-party protocol, such that if at least one of the parties is honest, then the result is secure (in both aforementioned senses) and can be subsequently used for generating and verifying numerous proofs without any further trust. We design and implement such a protocol, tailored to efficiently support the state-of-the-art NIZK constructions with short and easy-to-verify proofs (Parno et al. IEEE S&P '13, Ben-Sasson et al. USENIX Sec '14, Danezis et al., ASIACRYPT '14). Applications of our system include generating public parameters for systems such as Zero cash (Ben-Sasson et al. IEEE S&P '13) and the scalable zero-knowledge proof system of (Ben-Sasson et al. CRYPTO '14).

Chen Xu, Jingsha He

The use of security certificates under the Cloud environment is the foundation to establish mutual trust between the Cloud and the user. In this paper, we propose an authentication method based on zero-knowledge proof and the mind of key escrow. With the method, authentication will not only satisfy the requirement anonymity and security but also can recover the real identity information in special circumstances with the cooperation of multiple parties. We will show that this proposed method is more suitable for promotion through analysis and comparison with an existing scheme.

Bin Lian, Gongliang Chen, Jianhua Li

Zero-knowledge proof protocol is a basic cryptographic technique. And zero-knowledge proof of double discrete logarithm has some particular properties, so it has been widely applied in many security systems. But the efficient problem of zero-knowledge proof of double discrete logarithm has not been solved to this day, since there are some special difficulties in computing this kind of knowledge proof. Hence, the time complexity and the space complexity of existing schemes are all O(k), where k is a security parameter. After redesigning the basic construction of knowledge proof, we provide a new zero-knowledge proof of double discrete logarithm, which is the first scheme with O(1) time complexity and O(1) space complexity. If introducing an off-line TTP (trusted third party), we can provide two additional zeroknowledge proof schemes of double discrete logarithm, one is even more efficient than the first one, the other one solves another open problem, which is how to efficiently prove the equality of double discrete logarithms in zero-knowledge way, and the existing techniques cannot solve this problem. We also provide the detailed security proofs of our designs and efficiency analysis, comparing with the existing schemes. The significant improvement in efficiency of this basic cryptographic technique is also helpful for many security systems.

Marcella Atzori

The English version of this paper can be found at: http://ssrn.com/abstract=2709713 Italian Abstract: La tecnologia fondamentale del protocollo Bitcoin, conosciuta come blockchain, è emersa recentemente in tutta la sua straordinaria portata innovativa, teoricamente in grado di riconfigurare le nostre attuali interazioni economiche, politiche e sociali. Sebbene l'interesse accademico per questa tecnologia sia ormai crescente, finora non è stata ancora divulgata un'analisi esaustiva delle sue applicazioni dal punto di vista politologico. Questa ricerca si propone di discutere i punti essenziali di una governance decentralizzata fondata sulla blockchain, che sfida in varia misura i meccanismi tradizionali della autorità statale, della cittadinanza e della democrazia. In particolare, la ricerca si pone l'obiettivo di verificare la performance della blockchain e delle piattaforme decentralizzate come strumenti iperpolitici, in grado cioè di gestire interazioni sociali su ampia scala e di destituire eventualmente le autorità centrali tradizionali. L'analisi evidenzia i rischi relativi a posizioni dominanti di natura privatistica negli ecosistemi distribuiti, che potrebbero spogliare i cittadini dei loro diritti e permettere l'insorgere di una società globale senza stato. Se gli utopisti tecnologici sollecitano la destituzione di qualsiasi autorità centrale, questa ricerca difende invece il ruolo dello Stato come necessario punto di coordinazione nella società civile e dimostra come la decentralizzazione attuata attraverso algoritmi e sistemi di consenso distribuito costituisca una teoria organizzativa, non una teoria politica autonoma. English Abstract: The core technology of Bitcoin, the blockchain, has recently emerged as a disruptive innovation with a wide range of applications, potentially able to redesign our interactions in business, politics and society at large. Although scholarly interest in this subject is growing, a comprehensive analysis of blockchain applications from a political perspective is severely lacking to date. This paper aims to fill this gap and it discusses the key points of blockchain-based decentralized governance, which challenges to varying degrees the traditional mechanisms of State authority, citizenship and democracy. In particular, the paper verifies to which extent blockchain and decentralized platforms can be considered as hyper-political tools, capable to manage social interactions on large scale and dismiss traditional central authorities. The analysis highlights risks related to a dominant position of private powers in distributed ecosystems, which may lead to a general disempowerment of citizens and to the emergence of a stateless global society. While technological utopians urge the demise of any centralized institution, this paper advocates the role of the State as a necessary central point of coordination in society, showing that decentralization through algorithm-based consensus is an organizational theory, not a stand-alone political theory.

Ruizhong Chen, Lihao Wei, Hong Zou, Meijie Zhai

Project development in a power enterprise always needs to authorize external devices access to the enterprise intranet for testing. In order to avoid an external device with a virus and pose a security risk to the power information system, external devices should have strict security assessment before access the enterprise intranet. But after the security assessment, the device user still be possible to change the platform configuration. Remote attestation is one of important measures when two sides need to communicate. It is concernful to attest the remote platform is trusty but not revealing the any private information of the platform. For this reason, we designed a novel remote anonymous attestation protocol based on TCM. The proposed protocol does not need extra zero knowledge proof and the involvement of the third trusted party and the composite signature scheme is proved secure against existential forgery on adaptively chosen message. So this protocol has better security and execution property.

David C. Parkes, C. Thorpe, Wei Li

Can an exchange be “dark,” so that orders are not displayed, while simultaneously trustworthy, so that the execution of trades and flow of information occur as promised? SEC actions against dark pools suggest cause for concern, and regulators seem to be moving towards requiring more disclosure. Yet there is a clear tension: trading order information is widely exploited. Therefore, institutional investors have a strong interest in keeping pre-trade information about large trades hidden. Secrecy-preserving proofs of correctness can be used to build trust without revealing unnecessary information. By performing operations on obfuscated representations of orders (perhaps encrypted or otherwise hidden), a zero knowledge proof can be provided, allowing anyone to verify correctness of trades. Crucially, this can be done without revealing any information beyond this correctness. This technology can be usefully applied to construct provably trustworthy dark pools. Additional practical protocols relax the definition of “zero knowledge" to reveal limited information, providing necessary transparency for efficient market operation while limiting information that can be exploited by observers. Coupled with Trusted Computing hardware, these protocols can provide an excellent balance of practicality with secrecy

Matteo Maffei, Giulio Malavolta, Manuel Reinert, Dominique Schröder

Cloud storage has rapidly become a cornerstone of many IT infrastructures, constituting a seamless solution for the backup, synchronization, and sharing of large amounts of data. Putting user data in the direct control of cloud service providers, however, raises security and privacy concerns related to the integrity of outsourced data, the accidental or intentional leakage of sensitive information, the profiling of user activities and so on. Furthermore, even if the cloud provider is trusted, users having access to outsourced files might be malicious and misbehave. These concerns are particularly serious in sensitive applications like personal health records and credit score systems. To tackle this problem, we present GORAM, a cryptographic system that protects the secrecy and integrity of outsourced data with respect to both an untrusted server and malicious clients, guarantees the anonymity and unlink ability of accesses to such data, and allows the data owner to share outsourced data with other clients, selectively granting them read and write permissions. GORAM is the first system to achieve such a wide range of security and privacy properties for outsourced storage. In the process of designing an efficient construction, we developed two new, generally applicable cryptographic schemes, namely, batched zero-knowledge proofs of shuffle and an accountability technique based on chameleon signatures, which we consider of independent interest. We implemented GORAM in Amazon Elastic Compute Cloud (EC2) and ran a performance evaluation demonstrating the scalability and efficiency of our construction.