A simple post-quantum non-interactive zero-knowledge proof from garbled circuits

DOI10.1007/978-3-030-88323-2_14zbMath1492.94085OpenAlexW3205799449MaRDI QIDQ2151307

Kaiyi Zhang, Hongrui Cui

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88323-2_14

zbMATH Keywords

post-quantum cryptographygarbled circuitpublic-coin zero-knowledge proof system

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Uses Software

• Ligero
• ZKBoo
• Libra

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient secure two-party protocols. Techniques and constructions
• Stacked garbling. Garbled circuit proportional to longest execution path
• Advances in cryptology -- CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18--22, 2019. Proceedings. Part II
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Revisiting post-quantum Fiat-Shamir
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• Two Halves Make a Whole
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Improved Garbled Circuit: Free XOR Gates and Applications
• Foundations of Cryptography
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Garbled Circuits as Randomized Encodings of Functions: a Primer
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: A simple post-quantum non-interactive zero-knowledge proof from garbled circuits