Yandex Deploys OPRF Protocol to Protect Phone Numbers in Mandatory Audience Measurement Data Sharing

Yandex has detailed a cryptographic scheme using Oblivious Pseudorandom Function (OPRF) to help Russian audiovisual services comply with new legislation requiring transmission of user identifiers linked to phone numbers. The approach replaces a naive shared-secret hashing method that created a single point of compromise across dozens of competing companies. Instead, two independent third parties each hold separate secret keys and process blinded elliptic-curve points derived from normalized E.164 phone numbers. Services obtain deterministic identifiers without learning the third-party keys and without exposing raw numbers to the authorized research organization. The design distributes trust, limits offline brute-force attacks to scenarios requiring both keys plus final identifiers, and adds rate limits plus key-rotation capabilities to deter abuse. Yandex positions the solution as a practical compromise between regulatory demands, competitive secrecy, and user privacy.

HabrTranslated from Russian

Read at source

Yandex has published a detailed technical account of how Russian audiovisual services are meeting new legal requirements to share user identifiers derived from phone numbers while avoiding a single point of compromise.

Regulatory Background

Under recent legislation, 23 registered audiovisual platforms must transmit an additional user identifier to an authorized research organization. The identifier must be consistent across services for the same normalized phone number so that the same individual can be counted once regardless of device or platform.

Why Simple Hashing Failed

An initial proposal relied on a shared secret key combined with Argon2 or HMAC-SHA256 over normalized numbers. While functionally correct, any leakage of the common key would allow an attacker to reverse all identifiers from every participating service. Yandex assessed this risk as unacceptable given the number of independent companies involved.

OPRF Construction

The chosen solution is based on Oblivious Pseudorandom Function as specified in RFC 9497. Each phone number is first normalized to E.164 format, mapped to an elliptic-curve point via hash-to-curve, and blinded with a fresh random scalar. Two independent third parties, each holding its own secret scalar, successively multiply the blinded point. After unblinding and final hashing, the service obtains a stable identifier without ever learning either secret key.

Operational Properties

  • Raw phone numbers never leave the originating service or reach the research organization.
  • Compromise of one third party is insufficient for offline dictionary attacks.
  • Rate limits and request-volume monitoring deter malicious clients from building full lookup tables.
  • Key rotation remains possible without changing identifiers already issued.

The final architecture requires each audiovisual service to interact with exactly two third-party OPRF endpoints before sending the resulting identifier to the research organization.

Meridian digestThe week's most consequential security stories, distilled into one briefing.See the digest

More in Privacy & Surveillance

Maximizing iPhone Privacy: Essential Settings to Enable, Disable, and Verify Immediately
Top 10 Secure DNS Servers for Privacy, Threat Blocking and Ad Filtering in 2026
WebRTC IP Leaks Explained: Why Disabling the Protocol Harms Anonymity in Anti-Detect Browsers