Paper 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).
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Inscrypt 2021
- Keywords
- Zero-knowledgeGarbled circuitPost-Quantum
- Contact author(s)
- kzoacn @ sjtu edu cn
- History
- 2021-08-23: received
- Short URL
- https://ia.cr/2021/1068
- License
-
CC BY
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}
}
