Schnorr Non-interactive Zero-Knowledge Proof
RFC 8235, “Schnorr Non-interactive Zero-Knowledge Proof”, is an Informational document published in September 2017 by F. Hao. The canonical text is published by the RFC Editor.
Abstract
This document describes the Schnorr non-interactive zero-knowledge (NIZK) proof, a non-interactive variant of the three-pass Schnorr identification scheme. The Schnorr NIZK proof allows one to prove the knowledge of a discrete logarithm without leaking any information about its value. It can serve as a useful building block for many cryptographic protocols to ensure that participants follow the protocol specification honestly. This document specifies the Schnorr NIZK proof in both the finite field and the elliptic curve settings.
What “Informational” means
Published for the general information of the community. It does not define an IETF standard and carries no standards-track status.
The canonical text of RFC 8235 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 8234 Updates to MPLS Transport Profile Linear Protection in Automatic Protection Switching Mode
- RFC 8236 J-PAKE: Password-Authenticated Key Exchange by Juggling
- RFC 8233 Extensions to the Path Computation Element Communication Protocol to Compute Service-Aware Label Switched Paths
- RFC 8237 MPLS Label Switched Path Pseudowire Status Refresh Reduction for Static PWs
- RFC 8232 Optimizations of Label Switched Path State Synchronization Procedures for a Stateful PCE
- RFC 8238 Data Center Benchmarking Terminology
- RFC 8231 Path Computation Element Communication Protocol Extensions for Stateful PCE
- RFC 8239 Data Center Benchmarking Methodology