liveBook · Manning

Blinding factor

As explained in Real-World Cryptography

A blinding factor is a random value used to conceal an input or intermediate cryptographic value while preserving the ability to later remove the concealment.

A blinding factor is a fresh random value that conceals an input before a cryptographic operation, then enables the original result to be recovered. section 11.2.2

An OPRF uses the factor in four steps:

  • Alice chooses a new random factor r for each protocol run. section 11.2.2
  • She blinds group element x by computing x^r and sends the concealed value to Bob. section 11.2.2
  • Bob applies his secret key k, returning (x^r)^k without learning x. section 11.2.2
  • Alice removes the concealment with r's inverse, recovering x^k. section 11.2.2

Same input, different concealment

Different random blinding factors produce different messages to Bob, but the same input produces the same final PRF result after unblinding. section 11.2.2

How Real-World Cryptography covers it

How deep it goes
Explains the OPRF flow and group equations, stopping short of implementation-level details.
Examples
Demonstrates Alice and Bob using x, r, and k to compute x^r, (x^r)^k, and x^k.
What it assumes
Assumes basic PRF knowledge and introduces group elements, exponentiation, secret keys, and inverse-based unblinding.
What you can do after
Apply it via an OPRF walkthrough that blinds an input, receives a blinded evaluation, and unblinds the result.
How it connects
Connects blinding factors to OPRFs, PRFs, MACs, group elements, discrete logarithms, and OPAQUE.
Cover of Real-World Cryptography
liveBookmanning.com
Read Real-World Cryptography on liveBook Get the book at manning.com

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.