Poster: An Efficient Permissioned Blockchain with Provable Reputation Mechanism

Abstract

Permissioned blockchains take more reliability on participants than permissionless ones. In this poster, we focus on a hierarchical scenario of permissioned blockchains, which includes three types of participants: providers, collectors, and governors. Such a scenario has many applications in the field of IoT data collection, horizontal strategic alliances, etc. Our object is to reduce the cost of the governor's transaction verification. For this purpose, we propose a reputation protocol to help the governor measure the reliability of collectors. Based on the measurement of collectors' reputations, governors can pack high-quality transactions from reliable collectors into blocks, and thus the cost of verifying transactions can be decreased effectively. Through theoretical analysis, our protocol dramatically reduces the verification loss of governors.