Cryptology ePrint Archive: Report 2020/1573

Halo 0.9: A Halo Protocol with Fully-Succinctness

Lira Wang

Abstract: Zero-Knowledge Proof is a crucial tool for privacy preserving and stake proving. It allows the Prover to convince the Verifier about the validity of some statement without leaking any knowledge of his own. Quantities of zero knowledge protocols have been proposed by now and one of the state-of-the-art works is Halo [1], which is brought about by Bowe, Grigg and Hopwood. Even though nested amortization technique used in Halo, the Verifier still has to compute an O(n) operation ultimately. As a result, Halo is not a fully succinct zero-knowledge scheme and infeasible to be utilized in some scenarios such as Ethereum Smart Contract applications. We propose Halo 0.9, which is an enhanced version of Halo aiming at the issue above. Specifically, we introduce the SRS in [2] as the substitute for the random vector in the inner product and thus transform the Pedersen vector commitment to Kate polynomial commitment [2]. On the premise of original Halo protocol remained, the computation of Verifier is in logarithmic time.

Category / Keywords: applications / Succinct Proof, Halo, Zero-knowledge

Date: received 16 Dec 2020, last revised 28 Dec 2020

Contact author: lirawang at yahoo com

Available format(s): PDF | BibTeX Citation

Version: 20201228:152041 (All versions of this report)

Short URL: ia.cr/2020/1573


[ Cryptology ePrint archive ]