RFC 6287: OCRA: OATH Challenge-Response Algorithm

In plain English — editorial summary, not part of the RFC

This document describes an algorithm for challenge-response authentication developed by the Initiative for Open Authentication (OATH). The specified mechanisms leverage the HMAC-based One-Time Password (HOTP) algorithm and offer one-way and mutual authentication, and electronic signature capabilities. This document is not an Internet Standards Track specification; it is published for informational purposes.

Document record

Document ID

RFC6287

Published

June 2011

Authors

D. M'Raihi; J. Rydell; S. Bajaj; S. Machani; D. Naccache

Status

INFORMATIONAL

Stream

IETF

Area

—

Pages

38

Also known as

—

• Read the full RFC text →
• Plain text version
• IETF Datatracker history
• DOI: 10.17487/RFC6287
• Reported errata exist →

Topics

• HOTP
• TOTP
• One-Time Password
• Authentication
• Signature

Related documents

Ranked automatically by shared keywords, IETF area and stream — not by editorial selection.

• RFC 7427Signature Authentication in the Internet Key Exchange Version 2 (IKEv2)Current

  January 2015

• RFC 4686Analysis of Threats Motivating DomainKeys Identified Mail (DKIM)Current

  September 2006

• RFC 8292Voluntary Application Server Identification (VAPID) for Web PushCurrent

  November 2017

• RFC 8332Use of RSA Keys with SHA-256 and SHA-512 in the Secure Shell (SSH) ProtocolCurrent

  March 2018

• RFC 3008Domain Name System Security (DNSSEC) Signing AuthorityObsoleted

  November 2000

• RFC 6283Extensible Markup Language Evidence Record Syntax (XMLERS)Current

  July 2011

• RFC 6267MIKEY-IBAKE: Identity-Based Authenticated Key Exchange (IBAKE) Mode of Key Distribution in Multimedia Internet KEYing (MIKEY)Current

  June 2011

• RFC 6249Metalink/HTTP: Mirrors and HashesCurrent

  June 2011

Also filed under

• INFORMATIONAL
• 2011
• IETF stream