Client-server Identification Protocols with Quantum PUF

Recently, major progress has been made towards the realisation of quantum internet to enable a broad range classically intractable applications. These applications such as delegated computation require running secure identification protocol between low-resource and high-resource party provide communication. In this work, we propose two protocols based on emerging hardware solutions, Physical Unclonable Functions (qPUFs). The first allows prove its identity in second protocol, it is vice-versa. Unlike existing Quantum Read-out PUFs which rely security against specific family attacks, our provable exponential any Polynomial-Time adversary with resource-efficient parties. We comprehensive comparison proposed terms resources memory computing ability required both parties well communication overhead them.