Blockchain Papers

Georgia Koloniari, Evaggelia Pitoura

No abstract is available for this record.

Wanzong Peng, Tongliang Lu, Wenju Peng, Zhongpan Wang

File sharing, being the foundation of the Internet, has traditionally relied on a centralized service architecture resulting in significant maintenance costs. Moreover, due to the lack of an effective file management system, instances of sensitive information going out of control and loss of confidentiality in file sharing have occurred frequently. In order to address the difficulty of tamper detection and the lack of supervision in the entire process of file transfer in the current Internet environment, this paper designs a blockchain-based system architecture for secure sharing of electronic documents. An efficient blockchain model is used in our framework, and with the help of distributed storage system and asymmetric encryption technology, file sharing can be controlled, reliable and traceable in the transfer process. Referring to existing consensus mechanisms, e.g., Delegated Proof of Stake (DPoS) and Practical Byzantine Fault Tolerance (PBFT), we propose a new consensus for efficient and secure file sharing. Our experimental results show that our framework can maintain a higher throughput than existing schemes.

Khaled Ragab, T. Ono, N. Kaji, K. Mori

The headway towards the outstanding future can be realized with the productive cooperation among peoples and organizations. Inspired from the spirit of cooperation in the rapidly social changing communities, we propose an autonomous decentralized community (ADC) concept. It is a group of autonomous members, whereas each member has his own objectives, complies with the community obligations and cooperates with the others for achieving his own objectives. ADC system has to meet the heterogeneous and continuously changing requirements of the community service utilization and provision. It requires support for real-time communication among community members. Therefore, we propose an autonomous decentralized community communication technique. It satisfies the fairness by granted an equal opportunity among the community members. Moreover, it approves the scalability of the system regardless with the number of the community members.

Yili Gong, Fangpeng Dong, Wei Li, Zhiwei Xu

Grids enable users to share and access large collections and various types of resources in wide areas, and how to locate resources in such dynamic, heterogeneous and autonomous distributed environments is a key and challenging issue. In this paper, a three-level decentralized and dynamic VEGA Infrastructure for Resource Discovery (VIRD) is proposed. In this architecture, every Border Grid Resource Name Server (BGRNS) or Grid Resource Name Server (GRNS)has its own local policies, governing information organization, management and searching. Changes in resource information are propagated dynamically among GRNS servers according to a link-statelike algorithm. A client can query its designated GRNS either recursively or iteratively. Optimizing techniques, such as shortcut, are adopted to make the dynamic framework more flexible and efficient. A simulator called SimVIRD is developed to verify the proposed architecture and algorithms.Experiment results indicate that this architecture could deliver good scalability and performance for grid resource discovery.

Philipp Obreiter, Birgitta König‐Ries, Michael Klein

In the context of mobile and wireless devices, an information system is no longer a centralized component storing all the relevant data nor is it a decentralized component governed by a common authority. Rather, the information spread across huge numbers of autonomous mobile and wireless devices owned by independent organizations and individuals can be regarded as a highly dynamic, virtual information system. For this vision to become reality, the autonomous devices involved need to be motivated to cooperate. This cooperation needs to occur not only on the application layer, but, depending on the network architecture, also on the lower layers from the link layer on upwards. In this report, we investigate on which protocol layers cooperation is needed and what constitutes uncooperative behavior. We then identify necessary properties of incentive schemes that encourage cooperation and discourage uncooperative behavior. In this context, we examine remuneration types that are a major constituent of incentive schemes. Finally, using the example of ad hoc networks, the most challenging technical basis of a wireless information system, we compare existing incentive schemes to these characteristics.

Jerome H. Saltzer

A currently popular systems research project is to explore the possibilities and problems for computer system organization that arise from the rapidly falling cost of computing hardware. Interconnecting fleets of mini- or micro-computers and putting intelligence in terminals and concentrators to produce so-called "distributed systems " has recently been a booming development activity. While these efforts range from ingenious to misguided, many seem to miss a most important aspect of the revolution in hardware costs: that more than any other factor, the en_ ~ cost of acquiring and operating a free-standing, complete computer system has dropped and continues to drop rapidly. Where a decade ago the capital outlay required to install a computer system ranged from $150,000 up into the millions, today the low end of that range is below $15,000 and dropping. The consequence of this particular observation for system structure comes from the next level of analysis. In most organizations, decisions to make capital acquisitions tend to be more centralized for larger capita] amounts,