Cryptology ePrint Archive: Report 2021/1068

A Simple Post-Quantum Non-Interactive Zero-Knowledge Proof from Garbled Circuits

Hongrui Cui and Kaiyi Zhang

Abstract: We construct a simple public-coin zero-knowledge proof system solely based on symmetric primitives, from which we can apply the Fiat-Shamir heuristic to make it non-interactive. Our construction can be regarded as a simplified cut-and-choose-based malicious secure twoparty computation for the zero-knowledge functionality. Our protocol is suitable for pedagogical purpose for its simplicity (code is only 728 lines).

Category / Keywords: cryptographic protocols / Zero-knowledge, Garbled circuit, Post-Quantum

Original Publication (with minor differences): Inscrypt 2021

Date: received 17 Aug 2021

Contact author: kzoacn at sjtu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20210823:062924 (All versions of this report)

Short URL: ia.cr/2021/1068


[ Cryptology ePrint archive ]