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

IETF · RFC · RFC9381

RFC9381 · Verifiable Random Functions (VRFs)

Verifiable Random Functions (VRFs)

A Verifiable Random Function (VRF) is the public key version of a keyed cryptographic hash. Only the holder of the secret key can compute the hash, but anyone with the public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies VRF constructions based on RSA and elliptic curves that are secure in the cryptographic random oracle model. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.

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

A Verifiable Random Function (VRF) is the public key version of a keyed cryptographic hash. Only the holder of the secret key can compute the hash, but anyone with the public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies VRF constructions based on RSA and elliptic curves that are secure in the cryptographic random oracle model. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.

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

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

Полные импортированные сведения карточки
{
  "id": "RFC9381",
  "number": 9381,
  "title_en": "Verifiable Random Functions (VRFs)",
  "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": "A Verifiable Random Function (VRF) is the public key version of a keyed cryptographic hash. Only the holder of the secret key can compute the hash, but anyone with the public key can verify the correctness of the hash. VRFs are useful for preventing enumeration of hash-based data structures. This document specifies VRF constructions based on RSA and elliptic curves that are secure in the cryptographic random oracle model. This document is a product of the Crypto Forum Research Group (CFRG) in the IRTF.",
  "authors": [
    "S. Goldberg",
    "L. Reyzin",
    "D. Papadopoulos",
    "J. Včelák"
  ],
  "organizations": [],
  "publication_date": "2023-08-01",
  "current_status": "INFORMATIONAL",
  "current_status_ru": "Информационный",
  "publication_status": "INFORMATIONAL",
  "publication_status_ru": "Информационный",
  "lifecycle": "informational",
  "lifecycle_ru": "Справочный",
  "stream": "IRTF",
  "stream_ru": "Исследовательская группа Интернета (IRTF)",
  "area": "",
  "area_ru": "",
  "working_group": "",
  "source_draft": "draft-irtf-cfrg-vrf-15",
  "page_count": 47,
  "doi": "10.17487/RFC9381",
  "keywords": [
    "public key cryptography",
    "hashing",
    "authenticated denial"
  ],
  "formats": [
    "HTML",
    "TXT",
    "PDF",
    "XML"
  ],
  "relations": {
    "obsoletes": [],
    "obsoleted_by": [],
    "updates": [],
    "updated_by": [],
    "is_also": [],
    "see_also": []
  },
  "links": {
    "info": "https://www.rfc-editor.org/info/rfc9381/",
    "html": "https://www.rfc-editor.org/rfc/rfc9381.html",
    "txt": "https://www.rfc-editor.org/rfc/rfc9381.txt",
    "datatracker": "https://datatracker.ietf.org/doc/rfc9381/"
  }
}