[Paper Review] Authenticated tree parity machine key exchange

Markus Volkmer, André Schaumburg|ArXiv.org|Aug 20, 2004

Chaos-based Image/Signal Encryption11 references5 citations

TL;DR

This paper proposes two integrated authentication mechanisms for the Tree Parity Machine (TPM) key exchange protocol, ensuring security against Man-in-the-Middle and known attacks by leveraging shared inputs or a Zero-Knowledge protocol. The methods preserve the original physics of weight space dynamics while enabling secure, long-term use of the synchronised trajectory for key derivation without exposing secret weights.

ABSTRACT

The synchronisation of Tree Parity Machines (TPMs), has proven to provide a valuable alternative concept for secure symmetric key exchange. Yet, from a cryptographer's point of view, authentication is at least as important as a secure exchange of keys. Adding an authentication via hashing e.g. is straightforward but with no relation to Neural Cryptography. We consequently formulate an authenticated key exchange within this concept. Another alternative, integrating a Zero-Knowledge protocol into the synchronisation, is also presented. A Man-In-The-Middle attack and even all currently known attacks, that are based on using identically structured TPMs and synchronisation as well, can so be averted. This in turn has practical consequences on using the trajectory in weight space. Both suggestions have the advantage of not affecting the previously observed physics of this interacting system at all.

Motivation & Objective

• To address the critical need for native authentication in Neural Cryptography, which is otherwise absent in standard TPM key exchange.
• To prevent Man-in-the-Middle and other known attacks on TPM-based key exchange by embedding authentication within the protocol’s core mechanism.
• To enable secure, long-term use of the weight trajectory in TPMs without compromising security or performance.
• To maintain the original physical dynamics of the system while adding strong authentication guarantees.

Proposed method

• Uses common, secret inputs as a shared secret for authentication, ensuring only parties with identical input sequences can synchronize.
• Introduces a Zero-Knowledge protocol integrated into the interactive key exchange process to authenticate parties without revealing secrets.
• Employs a bit-package variant of the TPM protocol where outputs from multiple inputs are exchanged in batches to reduce communication overhead.
• Applies Hebbian learning rules to update weights only when both parties produce identical outputs, ensuring synchronized weight evolution.
• Uses weight reflection at boundaries [-L, L] to maintain integer weights within a defined range during learning.
• Employs a test for synchrony based on consecutive identical outputs over a minimum time window (t_min), excluding random agreement.

Experimental results

Research questions

• RQ1 Can authentication be natively integrated into the Tree Parity Machine key exchange without relying on external hashing or cryptographic primitives?
• RQ2 How can the security of the TPM protocol be strengthened against Man-in-the-Middle and known attacks that exploit identical TPM structures?
• RQ3 Does the use of shared inputs or a Zero-Knowledge protocol preserve the original physical dynamics of the weight space trajectory?
• RQ4 Can the synchronized trajectory be safely reused for deriving longer keys or one-time pad-like encryption?
• RQ5 What is the impact of authentication on the practical feasibility and efficiency of TPM-based key exchange in embedded systems?

Key findings

• The proposed authentication mechanisms successfully prevent all currently known attacks on TPM-based key exchange, including Man-in-the-Middle attacks.
• Using common inputs as a secret for authentication ensures that only parties with identical input sequences can achieve synchronization, preventing impersonation.
• The Zero-Knowledge-based authentication method allows parties to verify each other’s identity without revealing any secret information.
• Synchronization is achieved in finite time, with average synchronisation time peaking around 400 iterations for typical parameters, independent of input size N in the thermodynamic limit.
• The weight trajectory remains secure and usable for key derivation after synchronization, enabling concatenation of partial keys or one-time pad encryption with minimal overhead.
• Simulations show no repetition of 612-bit keys in a million runs when not using the trajectory, indicating a large effective key space.