Untangling RFID Privacy Models

Algorithm 1

The search procedure.

Input: 𝑛_ℛ;𝑛_𝒯,𝜈₂

Output: 𝜈^′₃

(1) 𝑂𝑢𝑡⟵⟂

(2) if  ∃ (ID_𝒯, 𝑜𝑙𝑑_𝒯,𝑐𝑢𝑟_𝒯) s.t. 𝑛_𝒯=𝑛_𝒯^𝑜𝑙𝑑 (resp. 𝑛_𝒯=𝑛^cur_𝒯) then

(3)      𝜈^′₁‖𝜈^′₂‖𝜈^′₃‖𝜈^′₄⟵𝐹_𝗄𝒯^𝑜𝑙𝑑(𝑛_ℛ,𝑛_𝒯^𝑜𝑙𝑑) (resp. 𝜈^′₁‖𝜈^′₂‖𝜈^′₃‖𝜈^′₄⟵𝐹_𝗄𝒯^𝑐𝑢𝑟(𝑛_ℛ,𝑛_𝒯^𝑐𝑢𝑟))

(4)      if 𝜈^′₂=𝜈₂  then

(5)         𝒯 is correctly authenticated

(6)         𝑂𝑢𝑡⟵𝜈^′₃

(7)         𝖴𝗉𝖽𝖺𝗍𝖾 (𝒯)

(8)      end if

(9) end if

(10) for all (𝖨𝖣_𝒯, 𝑜𝑙𝑑_𝒯,𝑐𝑢𝑟_𝒯)   and  𝑐𝜖{𝑜𝑙𝑑_𝒯,𝑐𝑢𝑟_𝒯} do

(11)      𝜈^′₁‖𝜈^′₂‖𝜈^′₃‖𝜈^′₄⟵𝐹_𝗄^𝑐_𝒯(𝑛_ℛ,𝑛_𝒯)

(12)       if  𝜈^′₂=𝜈₂  then

(13)          𝒯 is correctly authenticated

(14)          𝑂𝑢𝑡⟵𝜈^′₃

(15)          𝖴𝗉𝖽𝖺𝗍𝖾 (𝒯)

(16)      end if

(17) end for

(18) return  𝑂𝑢𝑡