PRFX: A Privacy-Preserving Prefix Summation Protocol on Blockchain with Zero-Knowledge Proof

Abstract

Prefix summation has found its applications over the years in various important domains from sorting to geographical terrain analysis. In our work, we address the privacy-preserving prefix summation problem on blockchain where multiple parties aim to aggregate their secret values through a secure multi-party computation. For the given problem, we propose a novel crypto-graphic protocol (i.e. PRFX) by integrating zero-knowledge proof and hypercube network topology. In addition, we theoretically show the applicability of the proposed protocol on the privacy-preserving delegation using Euler Tour Technique. We analyze the protocol with respect to the scalability perspectives including the communication, computation and storage overheads. The proposed protocol is also exposed to the experimental study where its performance is measured through the blockchain gas cost, the zero-knowledge proof generation time and lastly the zero-knowledge proof size.