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

Hongrui Cui; Kaiyi Zhang

Paper 2021/1068 Original: eprint.iacr.org/2021/1068 ↗

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

Hongrui Cui

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).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
History: 2021-08-23: last updated; 2021-08-23: published
Short URL: https://ia.cr/2021/1068
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/1068,
      author = {Hongrui Cui and Kaiyi Zhang},
      title = {A Simple Post-Quantum Non-Interactive Zero-Knowledge Proof from Garbled Circuits},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1068},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1068}
}