Next Article in Journal
Kolmogorov One-Way Functions Revisited
Previous Article in Journal
An Overview of DRAM-Based Security Primitives
Previous Article in Special Issue
Evaluating the Efficiency of Physical and Cryptographic Security Solutions for Quantum Immune IoT
Article Menu

Export Article

Open AccessFeature PaperArticle
Cryptography 2018, 2(2), 8; https://doi.org/10.3390/cryptography2020008

Robust Secure Authentication and Data Storage with Perfect Secrecy

Institute of Theoretical Information Technology, Technical University of München, 80333 München, Germany
*
Author to whom correspondence should be addressed.
Received: 29 January 2018 / Revised: 23 March 2018 / Accepted: 6 April 2018 / Published: 10 April 2018
(This article belongs to the Special Issue Physical Security in a Cryptographic Enviroment)
Full-Text   |   PDF [876 KB, uploaded 3 May 2018]   |  

Abstract

We consider an authentication process that makes use of biometric data or the output of a physical unclonable function (PUF), respectively, from an information theoretical point of view. We analyse different definitions of achievability for the authentication model. For the secrecy of the key generated for authentication, these definitions differ in their requirements. In the first work on PUF based authentication, weak secrecy has been used and the corresponding capacity regions have been characterized. The disadvantages of weak secrecy are well known. The ultimate performance criteria for the key are perfect secrecy together with uniform distribution of the key. We derive the corresponding capacity region. We show that, for perfect secrecy and uniform distribution of the key, we can achieve the same rates as for weak secrecy together with a weaker requirement on the distribution of the key. In the classical works on PUF based authentication, it is assumed that the source statistics are known perfectly. This requirement is rarely met in applications. That is why the model is generalized to a compound model, taking into account source uncertainty. We also derive the capacity region for the compound model requiring perfect secrecy. Additionally, we consider results for secure storage using a biometric or PUF source that follow directly from the results for authentication. We also generalize known results for this problem by weakening the assumption concerning the distribution of the data that shall be stored. This allows us to combine source compression and secure storage. View Full-Text
Keywords: authentication; secure storage; perfect secrecy; privacy leakage authentication; secure storage; perfect secrecy; privacy leakage
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Baur, S.; Boche, H. Robust Secure Authentication and Data Storage with Perfect Secrecy. Cryptography 2018, 2, 8.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Cryptography EISSN 2410-387X Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top