non-repudiation
Proof strong enough that the sender of a message or the author of an action cannot credibly deny it later.
In more detail
Non-repudiation needs evidence that only one party could have produced, which is why it comes from a digital signature made with a private key that only the signer holds. A shared secret key, as used by an HMAC, cannot provide it, because either side holding the key could have made the tag. The proof is only as strong as the signer's control of the private key, and shared accounts destroy it entirely.
Examples
openssl pkeyutl -verify -rawin -pubin -inkey alice.pub -in order.txt -sigfile order.sigA bank that holds the same HMAC key as its customer can mint a valid tag itself, so the tag proves nothing in court.Related terms
- digital signature — A value computed from data and a secret key that lets anyone with the matching verification key confirm the data came from the key holder and was not changed.
- private key — The secret half of a key pair, which proves its holder's identity and must never be shared.
- HMAC — A way of combining a secret key with a hash function to produce a tag that shows a message came from someone holding the key and was not changed.
- accountability — Being able to tie every action on a system to the one person who did it, so they can be held responsible.
Taught in
- CIA Triad, Non-Repudiation & Parkerian Hexad — Cybersecurity Fundamentals, GRC & Cryptography
- Asymmetric Cryptography: RSA, ECC & Diffie-Hellman — Cybersecurity Fundamentals, GRC & Cryptography