Virtual Proofs of Reality and their Physical Implementation

We discuss the question of how physical statements can be proven over digital communication channels between two parties (a "prover" and a "verifier") residing in two separate local systems. Examples include: (i) "a certain object in the prover's system has temperature X°C", (ii) "two certain objects in the prover's system are positioned at distance X", or (iii) "a certain object in the prover's system has been irreversibly altered or destroyed". As illustrated by these examples, our treatment goes beyond classical security sensors in considering more general physical statements. Another distinctive aspect is the underlying security model: We neither assume secret keys in the prover's system, nor do we suppose classical sensor hardware in his system which is tamper-resistant and trusted by the verifier. Without an established name, we call this new type of security protocol a "virtual proof of reality" or simply a "virtual proof" (VP). In order to illustrate our novel concept, we give example VPs based on temperature sensitive integrated circuits, disordered optical scattering media, and quantum systems. The corresponding protocols prove the temperature, relative position, or destruction/modification of certain physical objects in the prover's system to the verifier. These objects (so-called "witness objects") are prepared by the verifier and handed over to the prover prior to the VP. Furthermore, we verify the practical validity of our method for all our optical and circuit-based VPs in detailed proof-of-concept experiments. Our work touches upon, and partly extends, several established concepts in cryptography and security, including physical unclonable functions, quantum cryptography, interactive proof systems, and, most recently, physical zero-knowledge proofs. We also discuss potential advancements of our method, for example "public virtual proofs" that function without exchanging witness objects between the verifier and the prover.

[1]  Gang Xiong,et al.  Forgery: ‘Fingerprinting’ documents and packaging , 2005, Nature.

[2]  G. Whitesides,et al.  Solvent compatibility of poly(dimethylsiloxane)-based microfluidic devices. , 2003, Analytical chemistry.

[3]  Jean-Pierre Seifert,et al.  Physical Characterization of Arbiter PUFs , 2014, IACR Cryptol. ePrint Arch..

[4]  Ramesh Karri,et al.  Sensor physical unclonable functions , 2010, 2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST).

[5]  Ulrich Rührmair,et al.  SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information? , 2011, SOFSEM.

[6]  Miodrag Potkonjak,et al.  Hardware-Based Public-Key Cryptography with Public Physically Unclonable Functions , 2009, Information Hiding.

[7]  Ross J. Anderson.  Security engineering - a guide to building dependable distributed systems (2. ed.) , 2001 .

[8]  L. Susskind.  The world as a hologram , 1994, hep-th/9409089.

[9]  Robert Hesselbarth,et al.  Evaluation of Bistable Ring PUFs Using Single Layer Neural Networks , 2014, TRUST.

[10]  R. Bousso.  The Holographic principle , 2002, hep-th/0203101.

[11]  Ulrich Rührmair,et al.  SIMPL Systems: On a Public Key Variant of Physical Unclonable Functions , 2009, IACR Cryptol. ePrint Arch..

[12]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[13]  Kazuo Sakiyama,et al.  Security evaluation of bistable ring PUFs on FPGAs using differential and linear analysis , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[14]  Ulrich Rührmair,et al.  Physical Unclonable Functions in Cryptographic Protocols: Security Proofs and Impossibility Results , 2012, IACR Cryptol. ePrint Arch..

[15]  Thomas Appelquist.  Dimensional reduction in quantum gravity , 2008 .

[16]  P R Tapster,et al.  Quantum cryptography: A step towards global key distribution , 2002, Nature.

[17]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[18]  Ulrich Rührmair,et al.  Characterization of the bistable ring PUF , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[19]  Jorge Guajardo,et al.  FPGA Intrinsic PUFs and Their Use for IP Protection , 2007, CHES.

[20]  Ulrich Rührmair,et al.  Towards Electrical, Integrated Implementations of SIMPL Systems , 2010, IACR Cryptol. ePrint Arch..

[21]  R. Pappu,et al.  Physical One-Way Functions , 2002, Science.

[22]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[23]  Ulrich Rührmair,et al.  Physical Turing Machines and the Formalization of Physical Cryptography , 2011, IACR Cryptol. ePrint Arch..

[24]  R. Bousso.  A covariant entropy conjecture , 1999, hep-th/9905177.

[25]  Srinivas Devadas,et al.  Silicon physical random functions , 2002, CCS '02.

[26]  G. Edward Suh,et al.  Physical Unclonable Functions for Device Authentication and Secret Key Generation , 2007, 2007 44th ACM/IEEE Design Automation Conference.

[27]  J. Bekenstein.  How does the Entropy/Information Bound Work? , 2004, quant-ph/0404042.

[28]  Srinivas Devadas,et al.  PUF Modeling Attacks on Simulated and Silicon Data , 2013, IEEE Transactions on Information Forensics and Security.

[29]  Cliff Wang,et al.  Introduction to Hardware Security and Trust , 2011 .

[30]  Srinivas Devadas,et al.  Security Based on Physical Unclonability and Disorder , 2012 .

[31]  Moni Naor,et al.  Physical Zero-Knowledge Proofs of Physical Properties , 2014, CRYPTO.

[32]  Jan Sölter,et al.  Efficient Power and Timing Side Channels for Physical Unclonable Functions , 2014, CHES.

[34]  Marten van Dijk,et al.  A technique to build a secret key in integrated circuits for identification and authentication applications , 2004, 2004 Symposium on VLSI Circuits. Digest of Technical Papers (IEEE Cat. No.04CH37525).

[35]  Stephen A. Benton,et al.  Physical one-way functions , 2001 .

[36]  Ulrich Rührmair,et al.  Combined Modeling and Side Channel Attacks on Strong PUFs , 2013, IACR Cryptol. ePrint Arch..

[37]  Stefan Katzenbeisser,et al.  Physically Uncloneable Functions in the Universal Composition Framework , 2011, CRYPTO.

[38]  Edwin Pickstone,et al.  ILLEGITIMI NON CARBORUNDUM , 2012 .

[39]  Srinivas Devadas,et al.  Identification and authentication of integrated circuits , 2004, Concurr. Pract. Exp..

[40]  Wayne P. Burleson,et al.  Hybrid side-channel/machine-learning attacks on PUFs: A new threat? , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[41]  Rafail Ostrovsky,et al.  Position-Based Quantum Cryptography: Impossibility and Constructions , 2011, IACR Cryptol. ePrint Arch..

[42]  Michael J. Biercuk,et al.  Designing a practical high-fidelity long-time quantum memory , 2013, Nature Communications.

[43]  Blaise L. P. Gassend,et al.  Physical random functions , 2003 .

[44]  Ulrich Rührmair,et al.  The Bistable Ring PUF: A new architecture for strong Physical Unclonable Functions , 2011, 2011 IEEE International Symposium on Hardware-Oriented Security and Trust.

[45]  Jorge Guajardo,et al.  Extended abstract: The butterfly PUF protecting IP on every FPGA , 2008, 2008 IEEE International Workshop on Hardware-Oriented Security and Trust.