Skip to content

Non-Repudiation

Non-repudiation is the security property that stops someone from credibly denying an action they actually took. When a person sends a message, approves a payment, or edits a record, non-repudiation mechanisms produce evidence strong enough that the person cannot later claim it never happened or that an impostor did it.

NIST SP 800-53 Rev. 5 puts it as protection against an individual who falsely denies having performed a certain action, and the NIST glossary entry collects several more definitions from FIPS 186-5, SP 800-57, and CNSSI 4009. They all point at the same idea: proof that a third party, such as a court or an auditor, can check.

How does non-repudiation work?

Digital signatures are the workhorse behind it. The signer hashes the content and signs the hash with a private key only they control. FIPS 186-5, the Digital Signature Standard published in February 2023, approves RSA, ECDSA, and EdDSA for this. Anyone can verify the signature with the matching public key, and any change to the content breaks it, so the signature proves both origin and integrity.

Two more pieces make the evidence hold up. A digital certificate from a trusted certificate authority binds the public key to a named person, which is the job of public key infrastructure. A trusted timestamp proves when the signing happened. RFC 3161, published in August 2001, defines the Time-Stamp Protocol, where a time stamping authority signs a token showing the data existed at a given moment. That matters if the signer’s certificate is revoked later.

Watch the dependency, though. Non-repudiation only holds if the private key was truly under that person’s sole control. If keys are shared, poorly stored, or the signing timestamp comes from an untrusted source, the guarantee weakens, and a good defense attorney will point that out.

What is the difference between non-repudiation and authentication?

Authentication proves identity to the party checking it, right now. Non-repudiation proves an action to someone else, later. The difference shows up most clearly with symmetric cryptography.

Mechanism Integrity Authenticates origin Non-repudiation
Hash alone (SHA-256) Yes No No
MAC or HMAC (shared key) Yes Yes, to the other key holder No
Digital signature (private key) Yes Yes Yes

An HMAC proves the message came from someone holding the shared key. But both sender and receiver hold that key, so the receiver could have produced the same tag. A judge can’t tell which of them made it. Only an asymmetric signature, where one person alone holds the signing key, closes that gap.

What is an example of non-repudiation?

Say a purchasing manager approves a large purchase order in an e-signature system, signing with a key stored on her smart card and protected by a PIN. Months later she claims she never approved it. The company can show the signature verifies against her certificate, an RFC 3161 timestamp proves it was signed before her certificate was revoked, and the application’s audit trail records her badge-authenticated session. That’s strong evidence. If the signing key had sat in a shared folder that three assistants could reach, most of it would collapse.

One naming quirk trips people up in practice. RFC 5280 notes that recent editions of X.509 renamed the nonRepudiation key usage bit to contentCommitment, so certificate tools may show either name for the same flag. Setting that bit doesn’t create non-repudiation by itself. Key custody, timestamps, and process do the real work.

Why does non-repudiation matter for the CISSP exam?

Non-repudiation is one of the foundational security concepts in Domain 1: Security and Risk Management. Objective 1.2 of the 2024 outline lists it with confidentiality, integrity, availability, and authenticity as the five pillars of information security. It returns in Domain 3 under objective 3.6, where you select cryptographic solutions. Candidates should connect it to accountability, audit evidence, and the cryptographic mechanisms that make it enforceable, and know how it differs from plain authentication, which proves identity but not undeniable action.

Expect a few reliable traps. Symmetric encryption never provides non-repudiation, however strong the algorithm. Hashing alone gives integrity only. And when a question asks which key the sender uses to sign, it’s the sender’s own private key, not the recipient’s public key, which would provide confidentiality instead.

Related terms: Authentication, Digital Signature