Technische Universität München

The invention relates to a computer implemented method for authentication of a prover device (P) containing a Physically Unclonable Function (PUF). The method comprises the steps: a) determining (51) enrollment data of a model (M) containing reliability information for individual PUF responses by reading out a specific response of the PUF of the prover device (P), e.g. by repeatedly measuring a specific PUF response under different operation conditions, until a predetermined accuracy of the reliability information is reached, and storing the enrollment data and the model (M) containing reliability information for individual PUF responses of the prover device (P) known to a verifier device (V) in a database unit (DB) of the verifier device (V), b) the verifier device (V) generates a number (N1) that can be used just once and sends (S3) it to the prover device (P), c) the prover device (P) applies (S4) a Cryptographic Hash Function (HF) to a conjunction (C) of a fuzzy secret output (SO) of the PUF and at least the number (N1) that can be used just once and sends (55) at least a part of an output (HFO) of the Cryptographic Hash Function (HF) to the verifier device (V), and d) the verifier device (V) determines (S7) a symbol-specific likelihood from the model (M) containing reliability information for individual PUF responses to derive a number of hypotheses (H1, H2, H3) for the secret output, wherein the hypotheses (H1, H2, H3) have different likelihoods and the number depends on a noise level of the PUF, a predetermined false rejection rate and/or a length of the secret output (SO), and the verifier device (V) applies the Cryptographic Hash Function (HF) to the conjunction (C) of every hypothesis (H1; H2; H3) for the secret output of the number of hypotheses (H1, H2, H3) and at least the number (N1) that can be used just once until at least a part of an output of the Cryptographic Hash Function (HF) of the verifier device (V) matches (S9) at least the part of the output (HFO) of the Cryptographic Hash Function (HF) received from the prover device (P) for a successful authentication. Other aspects of the invention are a computer program product which causes the computer to execute the method and a system for authentication of a prover device (P) containing a Physically Unclonable Function (PUF).

A photoacoustic gas sensor (100) comprises an emitter (110) configured to emit light, a sensor (120) configured to measure pressure variations and a measurement cell (130) enclosing the emitter and the sensor. At least a first ventilation opening (140a) and a second ventilation opening (140b) connect the measurement cell (130) with an environment (150).

Provided is a first network node communicating in a sequence of network nodes in a network. The first network node comprises circuitry configured to generate a first cryptographic context with a second network node in the sequence. The circuitry is further configured to generate a second cryptographic context with a third network node in the sequence. With respect to the first network node, a directly neighboring network node has access to at most one of the first and the second cryptographic contexts.

Provided is a first network node for communicating with a second network node. The first network node includes circuitry configured to locally generate a first encryption key. The circuitry is further configured to communicate the first encryption key to the second network node via a first communication path. The circuitry is further configured to receive a second encryption key from the second network node via a second communication path. The second communication path involves at least one third network node different from a fourth network node of the first communication path. The circuitry is further configured to communicate encrypted payload data with the second network node. The encryption is based on a combination of the first and second encryption keys.

Zusammenfassung wird geladen …

Zusammenfassung wird geladen …

Zusammenfassung wird geladen …

Zusammenfassung wird geladen …

Zusammenfassung wird geladen …

Zusammenfassung wird geladen …