{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:25:26Z","timestamp":1771035926599,"version":"3.50.1"},"reference-count":24,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T00:00:00Z","timestamp":1523318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/cryptography2020008","type":"journal-article","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T13:06:08Z","timestamp":1523365568000},"page":"8","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Robust Secure Authentication and Data Storage with Perfect Secrecy"],"prefix":"10.3390","volume":"2","author":[{"given":"Sebastian","family":"Baur","sequence":"first","affiliation":[{"name":"Institute of Theoretical Information Technology, Technical University of M\u00fcnchen, 80333 M\u00fcnchen, Germany"}]},{"given":"Holger","family":"Boche","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Information Technology, Technical University of M\u00fcnchen, 80333 M\u00fcnchen, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Schaefer, R.F., Boche, H., Khisti, A., and Poor, H.V. (2017). Information Theoretic Security and Privacy of Information Systems, Cambridge University Press.","DOI":"10.1017\/9781316450840"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Csisz\u00e1r, I., and K\u00f6rner, J. (2011). Information Theory: Coding Theorems for Discrete Memoryless Systems, Cambridge University Press.","DOI":"10.1017\/CBO9780511921889"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","article-title":"The wire-tap channel","volume":"54","author":"Wyner","year":"1975","journal-title":"Bell Syst. Tech. J."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bloch, M., and Barros, J. (2011). Physical-Layer Security: From Information Theory to Security Engineering, Cambridge University Press.","DOI":"10.1017\/CBO9780511977985"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/18.243431","article-title":"Common randomness in information theory and cryptography. Part I: Secret sharing","volume":"39","author":"Ahlswede","year":"1993","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1561\/0100000051","article-title":"Biometric security from an information theoretical perspective","volume":"7","author":"Ignatenko","year":"2012","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Grigorescu, A., Boche, H., and Schaefer, R.F. (2015, January 16\u201319). Robust PUF based authentication. Proceedings of the IEEE International Workshop on Information Forensics and Security (WIFS), Rome, Italy.","DOI":"10.1109\/WIFS.2015.7368560"},{"key":"ref_9","unstructured":"Lai, L., Ho, S.-W., and Poor, H.V. (2008, January 23\u201326). Privacy-security tradeoffs in biometric security systems. Proceedings of the 46th Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign, IL, USA."},{"key":"ref_10","unstructured":"Boche, H., and Wyrembelski, R.F. (2013, January 21\u201324). Secret key generation using compound sources-optimal key-rates and communication costs. Proceedings of the 2013 9th International ITG Conference on Systems, Communication and Coding (SCC), M\u00fcnchen, Germany."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Grigorescu, A., Boche, H., and Schaefer, R.F. (2017). Robust Biometric Authentication from an Information Theoretic Perspective. Entropy, 19.","DOI":"10.3390\/e19090480"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Baur, S., and Boche, H. (2017, January 1\u20134). Robust authentication and data storage with perfect secrecy. Proceedings of the 2017 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Atlanta, GA, USA.","DOI":"10.1109\/INFCOMW.2017.8116437"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Baur, S., and Boche, H. (2017, January 4\u20137). Robust Secure Storage of Data Sources with Perfect Secrecy. Proceedings of the IEEE Workshop on Information Forensics and Security, Rennes, France.","DOI":"10.1109\/WIFS.2017.8267669"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Baur, S., and Boche, H. (2017, January 9\u201311). Storage of general data sources on a public database with security and privacy constraints. Proceedings of the 2017 IEEE Conference on Communications and Network Security (CNS), Las Vegas, NV, USA.","DOI":"10.1109\/CNS.2017.8228678"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Willems, F., and Ignatenko, T. (2012, January 1\u20136). Authentication based on secret-key generation. Proceedings of the 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), Cambridge, MA, USA.","DOI":"10.1109\/ISIT.2012.6283587"},{"key":"ref_16","unstructured":"Gallager, R. (1968). Information Theory and Reliable Communication, Springer."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wolfowitz, J. (1978). Coding Theorems of Information Theory, Springer.","DOI":"10.1007\/978-3-642-66822-7"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1214\/aoms\/1177706106","article-title":"The capacity of a class of channels","volume":"30","author":"Blackwell","year":"1959","journal-title":"Ann. Math. Stat."},{"key":"ref_19","unstructured":"Tavangaran, N., Baur, S., Grigorescu, A., and Boche, H. (2017, January 6\u20139). Compound biometric authentication systems with strong secrecy. Proceedings of the 2017 11th International ITG Conference on Systems, Communication and Coding (SCC), Hamburg, Germany."},{"key":"ref_20","unstructured":"Han, T.S. (2013). Information-Spectrum Methods in Information Theory, Springer Science & Business Media."},{"key":"ref_21","unstructured":"Boche, H., and Cai, N. (2018, January 16\u201320). Common Random Secret Key Generation on Arbitrarily Varying Source. Proceedings of the 23rd International Symposium on Mathematical Theory of Networks and Systems (MTNS2018), Hong Kong, China. in press."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1796","DOI":"10.1109\/JPROC.2015.2459652","article-title":"Secure Communication Under Channel Uncertainty and Adversarial Attacks","volume":"103","author":"Schaefer","year":"2015","journal-title":"Proc. IEEE"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3844","DOI":"10.1109\/TIT.2016.2565482","article-title":"A Channel Under Simultaneous Jamming and Eavesdropping Attack\u2014Correlated Random Coding Capacities Under Strong Secrecy Criteria","volume":"62","author":"Wiese","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3504","DOI":"10.1109\/TIT.2016.2550587","article-title":"The Arbitrarily Varying Wiretap Channel\u2014Secret Randomness, Stability, and Super-Activation","volume":"62","author":"Wiese","year":"2016","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/2\/8\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:00:12Z","timestamp":1760194812000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/2\/8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,10]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,6]]}},"alternative-id":["cryptography2020008"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2020008","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,10]]}}}