Untangling RFID Privacy Models

Box 1

Experiment Exp^{𝖤𝗑𝗂𝗌𝗍𝖾𝗇𝗍𝗂𝖺𝗅-𝖴𝖭𝖳}_𝒮,𝒜[𝜆_ref,𝜆_chal,𝒪].

(1) 𝒞 initializes the system 𝒮.

(2) 𝒜 requests 𝒞 to receive a tag 𝒯.

(3) 𝒜 chooses 𝐼, queries Oracle (𝒯,𝐼,𝒪) where |𝐼|≤𝜆_ref, and then receives Ω_𝐼(𝒯).

(4) 𝒜 requests 𝒞 to receive two challenge tags 𝒯₀ and 𝒯₁, such that 𝒯=𝒯₀ or 𝒯₁.

(5) 𝒜 chooses 𝐼₀ and 𝐼₁ such that |𝐼₀|≤𝜆_chal, |𝐼₁|≤𝜆_chal, and (𝐼₀∪𝐼₁)∩𝐼=∅.

(6) 𝒜 queries Oracle (𝒯₀,𝐼₀,𝒪) and Oracle (𝒯₁,𝐼₁,𝒪), and then receives Ω_𝐼0(𝒯₀) and Ω_𝐼1(𝒯₁).

(7) 𝒜 decides which of 𝒯₀ or 𝒯₁ is 𝒯, and outputs a guess bit 𝑏.

Exp^{𝖤𝗑𝗂𝗌𝗍𝖾𝗇𝗍𝗂𝖺𝗅-𝖴𝖭𝖳}_𝒮,𝒜 succeeds if 𝒯=𝒯_𝑏.