⌕ Поиск по атласу

IETF · RFC · RFC8235

RFC8235 · Schnorr Non-interactive Zero-Knowledge Proof

Schnorr Non-interactive Zero-Knowledge Proof

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.

Официальная английская аннотация

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.

Связи документа

Официальный источник · 2017-09-01

Полные импортированные сведения карточки
{
  "id": "RFC8235",
  "number": 8235,
  "title_en": "Schnorr Non-interactive Zero-Knowledge Proof",
  "title_ru": "",
  "summary_ru": "",
  "purpose_ru": "",
  "use_ru": "",
  "full_translation_path": "",
  "full_translation_checked_at": "",
  "full_translation_source_sha256": "",
  "architect_note_ru": "",
  "topics_ru": [],
  "translation_state": "not_prepared",
  "verification_level": "not_prepared",
  "verification_level_ru": "Русская выжимка не подготовлена",
  "verification_note_ru": "",
  "abstract_en": "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.",
  "authors": [
    "F. Hao"
  ],
  "organizations": [],
  "publication_date": "2017-09-01",
  "current_status": "INFORMATIONAL",
  "current_status_ru": "Информационный",
  "publication_status": "INFORMATIONAL",
  "publication_status_ru": "Информационный",
  "lifecycle": "informational",
  "lifecycle_ru": "Справочный",
  "stream": "INDEPENDENT",
  "stream_ru": "Независимый поток",
  "area": "",
  "area_ru": "",
  "working_group": "",
  "source_draft": "draft-hao-schnorr-06",
  "page_count": 13,
  "doi": "10.17487/RFC8235",
  "keywords": [
    "Zero-Knowledge Proof",
    "Schnorr NIZK proof",
    "Identification protocol"
  ],
  "formats": [
    "TXT",
    "HTML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc8235/",
    "html": "https://www.rfc-editor.org/rfc/rfc8235.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc8235.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc8235/"
  }
}