Non-repudiation

From HandWiki
Short description: Legal term

In law, non-repudiation is a situation where a statement's author cannot successfully dispute its authorship or the validity of an associated contract.[1] The term is often seen in a legal setting when the authenticity of a signature is being challenged. In such an instance, the authenticity is being "repudiated".[citation needed]

For example, Mallory buys a cell phone for $100, writes a paper cheque as payment, and signs the cheque with a pen. Later, she finds that she can't afford it, and claims that the cheque is a forgery. The signature guarantees that only Mallory could have signed the cheque, and so Mallory's bank must pay the cheque. This is non-repudiation; Mallory cannot repudiate the cheque. In practice, pen-and-paper signatures aren't hard to forge, but digital signatures can be very hard to break.

In security

In general, non-repudiation involves associating actions or changes with a unique individual. For example, a secure area may use a key card access system where non-repudiation would be violated if key cards were shared or if lost and stolen cards were not immediately reported. Similarly, the owner of a computer account must not allow others to use it, such as by giving away their password, and a policy should be implemented to enforce this.[2]

In digital security

In digital security, non-repudiation means:[3]

  • A service that provides proof of the integrity and origin of data.
  • An authentication that can be said to be genuine with high confidence.
  • An authentication that the data is available under specific circumstances, or for a period of time: data availability.[4]

Proof of data integrity is typically the easiest of these requirements to accomplish. A data hash such as SHA2 usually ensures that the data will not be changed undetectably. Even with this safeguard, it is possible to tamper with data in transit, either through a man-in-the-middle attack or phishing. Because of this, data integrity is best asserted when the recipient already possesses the necessary verification information, such as after being mutually authenticated.[5]

The common method to provide non-repudiation in the context of digital communications or storage is Digital Signatures, a more powerful tool that provides non-repudiation in a publicly verifiable manner.[6] Message Authentication Codes (MAC), useful when the communicating parties have arranged to use a shared secret that they both possess, does not give non-repudiation. A misconception is that encrypting, per se, provides authentication "If the message decrypts properly then it is authentic", which is not the case. MAC can be subject to several types of attacks, like: message reordering, block substitution, block repetition, .... Thus just providing message integrity and authentication, but not non-repudiation. To achieve non-repudiation one must trust a service (a certificate generated by a trusted third party (TTP) called certificate authority (CA)) which prevents an entity from denying previous commitments or actions (e.g. sending message A to B). The difference between MAC and Digital Signatures, one uses symmetric keys and the other asymmetric keys (provided by the CA). Note that the goal is not to achieve confidentiality: in both cases (MAC or digital signature), one simply appends a tag to the otherwise plaintext, visible message. If confidentiality is also required, then an encryption scheme can be combined with the digital signature, or some form of authenticated encryption could be used. Verifying the digital origin means that the certified/signed data likely came from someone who possesses the private key corresponding to the signing certificate. If the key used to digitally sign a message is not properly safeguarded by the original owner, digital forgery can occur.[7][8][9]

Trusted third parties (TTPs)

To mitigate the risk of people repudiating their own signatures, the standard approach is to involve a trusted third party.[10]

The two most common TTPs are forensic analysts and notaries. A forensic analyst specializing in handwriting can compare some signature to a known valid signature and assess its legitimacy. A notary is a witness who verifies an individual's identity by checking other credentials and affixing their certification that the person signing is who they claim to be. A notary provides the extra benefit of maintaining independent logs of their transactions, complete with the types of credentials checked, and another signature that can be verified by the forensic analyst. This double security makes notaries the preferred form of verification.[citation needed]

For digital information, the most commonly employed TTP is a certificate authority, which issues public key certificates. A public key certificate can be used by anyone to verify digital signatures without a shared secret between the signer and the verifier. The role of the certificate authority is to authoritatively state to whom the certificate belongs, meaning that this person or entity possesses the corresponding private key. However, a digital signature is forensically identical in both legitimate and forged uses. Someone who possesses the private key can create a valid digital signature. Protecting the private key is the idea behind some smart cards such as the United States Department of Defense's Common Access Card (CAC), which never lets the key leave the card. That means that to use the card for encryption and digital signatures, a person needs the personal identification number (PIN) code necessary to unlock it.[citation needed]

See also

References

  1. ↑ Li, Zhaozheng; Lei, Weimin; Hu, Hanyun; Zhang, Wei (2019). "A Blockchain-based Communication Non-repudiation System for Conversational Service". 2019 IEEE 13th International Conference on Anti-counterfeiting, Security, and Identification (ASID). pp. 6–10. doi:10.1109/ICASID.2019.8924991. ISBN 978-1-7281-2458-2. 
  2. ↑ Christopher Negus (2012). Linux Bible. Wiley. p. 580. ISBN 978-1-118-28690-6. https://books.google.com/books?id=w0gL9poGWIIC&pg=PA580. 
  3. ↑ Non-Repudiation in the Digital Environment (Adrian McCullagh)
  4. ↑ Yu, Mingchao; Sahraei, Saeid; Nixon, Mark; Han, Song (18 July 2020). "SoK: Sharding on Blockchain". Proceedings of the 1st ACM Conference on Advances in Financial Technologies. pp. 114–134. doi:10.1145/3318041.3355457. ISBN 9781450367325. https://dl.acm.org/doi/abs/10.1145/3318041.3355457. 
  5. ↑ Chen, Chin-Ling; Chiang, Mao-Lun; Hsieh, Hui-Ching; Liu, Ching-Cheng; Deng, Yong-Yuan (July 2020). "A Lightweight Mutual Authentication with Wearable Device in Location-Based Mobile Edge Computing". Wireless Personal Communications 113 (1): 575–598. doi:10.1007/s11277-020-07240-2. 
  6. ↑ Chia, Jason; Chin, Ji-Jian; Yip, Sook-Chin (2021-09-16). "Digital signature schemes with strong existential unforgeability" (in en). F1000Research 10: 931. doi:10.12688/f1000research.72910.1. PMID 36798451. 
  7. ↑ Wu, Wei; Zhou, Jianying; Xiang, Yang; Xu, Li (December 2013). "How to achieve non-repudiation of origin with privacy protection in cloud computing". Journal of Computer and System Sciences 79 (8): 1200–1213. doi:10.1016/j.jcss.2013.03.001. 
  8. ↑ "What are the differences between a digital signature, a MAC and a hash?". https://crypto.stackexchange.com/questions/5646/what-are-the-differences-between-a-digital-signature-a-mac-and-a-hash/5647#5647?newreg=74e26dac0c5540b7bfb89fd3729ff958. 
  9. ↑ Sosin, Artur (2018). "How to increase the information assurance in the information age". Journal of Defense Resources Management 9 (1): 45–57. ProQuest 2178518357. https://www.ceeol.com/search/article-detail?id=662913. 
  10. ↑ Zhou, Jianying; Gollmann, Dieter (1996). "Observations on non-repudiation". in Kim, Kwangjo; Matsumoto, Tsutomu (in en). Advances in Cryptology — ASIACRYPT '96. Lecture Notes in Computer Science. 1163. Berlin, Heidelberg: Springer. pp. 133–144. doi:10.1007/BFb0034842. ISBN 978-3-540-70707-3. https://link.springer.com/chapter/10.1007/BFb0034842. 

External links



Retrieved from "https://handwiki.org/wiki/index.php?title=Non-repudiation&oldid=3358370"