HyperMaze: Towards Privacy-Preserving and Scalable Permissioned Blockchain
Wei Liu, Zhiguo Wan, Jun Shao, Yong Yu
Abstract
Blockchain systems face two emergent problems, namely scalability and privacy, each of which has been addressed independently. However, how to achieve privacy and scalability simultaneously remains a challenging problem for blockchains. In this article, we propose a privacy-preserving and scalable permissioned blockchain system called HyperMaze employing the zero knowledge proof technique and a hierarchical system architecture. It gains scalability by adopting a hierarchy of multiple blockchains that processes transactions in parallel. We design an <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ID-based dual-balance account model</i> where an identity-based account is associated with two types of balances–a plaintext balance and a private (zero-knowledge) balance. Furthermore, we design a two-phase cross-chain transaction mechanism (2PXT) to achieve transaction privacy for both intra-chain and cross-chain transactions. We rigorously formulate a security model for HyperMaze under the universal composability framework, and then provide a simulation-based security proof. A prototype of HyperMaze is implemented and a series of experiments are conducted over up to 2,600 nodes to evaluate its performance. The experimental results show that a 4-level, (7,10)-threshold, 6-ary HyperMaze system can reach 19,440 TPS and the transaction confirmation latency is only 9.5 seconds. To our best knowledge, HyperMaze is the first high-throughput privacy-preserving blockchain whose throughput is over 19,000 TPS.