Zero-leakage multiple key-binding scenarios for SRAM-PUF systems based on the XOR-method

We show that the XOR-method based on linear error-correcting codes can be applied to achieve the secret-key capacity of binary-symmetric SRAM-PUFs. Then we focus on multiple key-bindings. We prove that no information is leaked by all the helper data about a single secret key both in the case where we use the same key all the time and when we use di↵erent keys. The notion of symmetry is crucial in these proofs.