IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Robust authentication and data storage with perfect secrecy
Sebastian Baur, Holger Boche
Abstract
We consider a Physical-Unclonable-Function (PUF)-based authentication process. We define achievable secret-key rate versus privacy-leakage rate pairs featuring perfect secrecy and uniform distribution of the secret-key. We derive the capacity region corresponding to this definition of achievability and thus show that it equals the known capacity region corresponding to weak secrecy. We define achievability requiring a small false acceptance probability and show that the corresponding capacity region is the same. We generalize our result for perfect secrecy to the case of a compound source. We also discuss the problem of secure data storage using data from a PUF when the statistics of the PUF are not perfectly known.