Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Adding in edits from Chloe Martindale #430

Merged
merged 1 commit into from
Oct 5, 2023
Merged

Adding in edits from Chloe Martindale #430

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 8 additions & 4 deletions draft-irtf-cfrg-opaque.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -313,10 +313,10 @@ Otherwise, the attacker can pre-compute a deterministic list of mapped
passwords leading to almost instantaneous leakage of passwords upon
server compromise.

This document describes OPAQUE, a PKI-free secure aPAKE that is secure
against pre-computation attacks. OPAQUE provides forward secrecy with
respect to password leakage while also hiding the password from the
server, even during password registration. OPAQUE allows applications
This document describes OPAQUE, an aPAKE that is secure against
pre-computation attacks (as defined in {{JKX18}}). OPAQUE provides forward
secrecy with respect to password leakage while also hiding the password from
the server, even during password registration. OPAQUE allows applications
to increase the difficulty of offline dictionary attacks via iterated
hashing or other key stretching schemes. OPAQUE is also extensible, allowing
clients to safely store and retrieve arbitrary application data on servers
Expand Down Expand Up @@ -1451,6 +1451,7 @@ variants:
between the private input `k` and public input `B`.
The output of this function is a unique, fixed-length byte string.

It is RECOMMENDED to use Elliptic Curve Diffie-Hellman for this key exchange protocol.
Implementations for recommended groups in {{configurations}}, as well as groups
covered by test vectors in {{test-vectors}}, are described in the following sections.

Expand Down Expand Up @@ -2368,6 +2369,9 @@ s = Hash(hashInput) mod L
Hash is the same hash function used in the main OPAQUE protocol for key derivation.
Its output length (in bits) must be at least L.

Both parties should perform validation (as in {{validation}}) on each other's
public keys before computing the above parameters.

## SIGMA-I Instantiation Sketch

A {{SIGMA-I}} instantiation differs more drastically from OPAQUE-3DH since authentication
Expand Down
Loading