Message authentication: Difference between revisions

Content deleted Content added

Inline

Revision as of 17:11, 23 December 2019

In information security, message authentication or data origin authentication is a property that a message has not been modified while in transit (data integrity) and that the receiving party can verify the source of the message.^[1] Message authentication does not necessarily include the property of non-repudiation.^[2]^[3]

Message authentication is typically achieved by using message authentication codes (MACs), authenticated encryption (AE) or digital signatures.^[2] The message authentication code, also known as digital authenticator, is used as an integrity check based on a secret key shared by two parties to authenticate information transmitted between them.^[4] It is based on using a cryptographic hash or symmetric encryption algorithm.^[5] The authentication key is only shared by exactly two parties (e.g. communicating devices), and the authentication will fail in the existence of a third party possessing the key since the algorithm will no longer be able to detect forgeries (i.e. to be able to validate the unique source of the message).^[6] In addition, the key must also be randomly generated to avoid its recovery through brute-force searches and related-key attacks designed to identify it from the messages transiting the medium.^[6]

Some cryptographers distinguish between "message authentication without secrecy" systems – which allow the intended receiver to verify the source of the message, but don't bother hiding the plaintext contents of the message – from authenticated encryption systems.^[7] Some cryptographers have researched subliminal channel systems that send messages that appear to use a "message authentication without secrecy" system, but in fact also transmit a secret message.

References

^ Mihir Bellare. "Chapter 7: Message Authentication" (PDF). CSE 207: Modern Cryptography. {{cite book}}: |work= ignored (help)
^ ^a ^b "Chapter 9 - Hash Functions and Data Integrity" (PDF). Handbook of Applied Cryptography. p. 361. {{cite book}}: Cite uses deprecated parameter |authors= (help)
^ "Data Origin Authentication". Web Service Security. Microsoft Developer Network.
^ Patel, Dhiren (2008). Information Security: Theory and Practice. New Delhi: Prentice Hall India Private Lt. p. 124. ISBN 9788120333512.
^ Jacobs, Stuart (2011). Engineering Information Security: The Application of Systems Engineering Concepts to Achieve Information Assurance. Hoboken, NJ: John Wiley & sons. p. 108. ISBN 9780470565124.
^ ^a ^b Walker, Jesse (2013). "Chapter 13 – Internet Security". In Vacca, John R. (ed.). Computer and Information Security Handbook (3rd ed.). Morgan Kaufmann Publishers. pp. 256–257. doi:10.1016/B978-0-12-803843-7.00013-2. ISBN 9780128038437.
^ Longo, G.; Marchi, M.; Sgarro, A. Geometries, Codes and Cryptography. p. 188.

This cryptography-related article is a stub. You can help Wikipedia by expanding it.

[cse207-1] Mihir Bellare. "Chapter 7: Message Authentication" (PDF). CSE 207: Modern Cryptography. {{cite book}}: |work= ignored (help)

[hac-2] "Chapter 9 - Hash Functions and Data Integrity" (PDF). Handbook of Applied Cryptography. p. 361. {{cite book}}: Cite uses deprecated parameter |authors= (help)

[msdn-3] "Data Origin Authentication". Web Service Security. Microsoft Developer Network.

[4] Patel, Dhiren (2008). Information Security: Theory and Practice. New Delhi: Prentice Hall India Private Lt. p. 124. ISBN 9788120333512.

[5] Jacobs, Stuart (2011). Engineering Information Security: The Application of Systems Engineering Concepts to Achieve Information Assurance. Hoboken, NJ: John Wiley & sons. p. 108. ISBN 9780470565124.

[Vacca-6] Walker, Jesse (2013). "Chapter 13 – Internet Security". In Vacca, John R. (ed.). Computer and Information Security Handbook (3rd ed.). Morgan Kaufmann Publishers. pp. 256–257. doi:10.1016/B978-0-12-803843-7.00013-2. ISBN 9780128038437.

[7] Longo, G.; Marchi, M.; Sgarro, A. Geometries, Codes and Cryptography. p. 188.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

@@ Line 1: / Line 1: @@
 In [[information security]], '''message authentication''' or '''data origin authentication''' is a property that a message has not been modified while in transit ([[data integrity]]) and that the receiving party can verify the source of the message.<ref name=cse207>{{cite book |author=[[Mihir Bellare]] |work=Lecture notes for cryptography course |title=CSE 207: Modern Cryptography |chapter=Chapter 7: Message Authentication |chapter-url=https://cseweb.ucsd.edu/~mihir/cse207/w-mac.pdf }}</ref> Message authentication does ''not'' necessarily include the property of [[non-repudiation]].<ref name=hac>{{Cite book |title=Handbook of Applied Cryptography |authors=[[Alfred J. Menezes]], [[Paul C. van Oorschot]], [[Scott A. Vanstone]] |chapter=Chapter 9 - Hash Functions and Data Integrity |pages=361 |url=http://cacr.uwaterloo.ca/hac/ |chapter-url=http://cacr.uwaterloo.ca/hac/about/chap9.pdf }}</ref><ref name=msdn>{{Cite book |title=Web Service Security |chapter=Data Origin Authentication |publisher=[[Microsoft Developer Network]] |chapter-url=https://msdn.microsoft.com/en-us/library/ff648434.aspx }}</ref>
-Message authentication is typically achieved by using [[message authentication code]]s (MACs), [[authenticated encryption]] (AE) or [[digital signature]]s.<ref name=hac /> The message authentication code, also known as digital authenticator, is used as an integrity check based on a secret key shared by two parties to authenticate information transmitted between them.<ref>{{Cite book|title=Information Security: Theory and Practice|last=Patel|first=Dhiren|publisher=Prentice Hall India Private Lt.|year=2008|isbn=9788120333512|location=New Delhi|pages=124}}</ref> It is based on using a [[Cryptographic hash function|cryptographic hash]] or [[Symmetric-key algorithm|symmetric encryption algorithm]].<ref>{{Cite book|title=Engineering Information Security: The Application of Systems Engineering Concepts to Achieve Information Assurance|last=Jacobs|first=Stuart|publisher=John Wiley & sons|year=2011|isbn=9780470565124|location=Hoboken, NJ|pages=108}}</ref> The authentication key is only shared by at least two parties or two communicating devices but it will fail in the existence of a third party since the algorithm will no longer be effective in detecting forgeries.<ref name=":0">{{Cite book|title=Computer and Information Security Handbook|last=Vacca|first=John|publisher=Morgan Kaufmann Publishers|year=2009|isbn=9780123743541|location=Burlington, MA|pages=111-112}}</ref> In addition, the key must also be randomly generated to avoid its recovery through brute force searches and related key attacks designed to identify it from the messages transiting the medium.<ref name=":0" />
+Message authentication is typically achieved by using [[message authentication code]]s (MACs), [[authenticated encryption]] (AE) or [[digital signature]]s.<ref name=hac /> The message authentication code, also known as digital authenticator, is used as an integrity check based on a secret key shared by two parties to authenticate information transmitted between them.<ref>{{Cite book|title=Information Security: Theory and Practice|last=Patel|first=Dhiren|publisher=Prentice Hall India Private Lt.|year=2008|isbn=9788120333512|location=New Delhi|pages=124}}</ref> It is based on using a [[cryptographic hash function|cryptographic hash]] or [[symmetric-key algorithm|symmetric encryption algorithm]].<ref>{{Cite book|title=Engineering Information Security: The Application of Systems Engineering Concepts to Achieve Information Assurance|last=Jacobs|first=Stuart|publisher=John Wiley & sons|year=2011|isbn=9780470565124|location=Hoboken, NJ|pages=108}}</ref> The authentication key is only shared by exactly two parties (e.g. communicating devices), and the authentication will fail in the existence of a third party possessing the key since the algorithm will no longer be able to detect forgeries (i.e. to be able to validate the unique source of the message).<ref name="Vacca">{{cite book |chapter=Chapter 13 – Internet Security |first=Jesse |last=Walker |title=Computer and Information Security Handbook |editor-last=Vacca |editor-first=John R. |publisher=Morgan Kaufmann Publishers |edition=3rd |year=2013 |isbn=9780128038437 |pages=256–257 |doi=10.1016/B978-0-12-803843-7.00013-2}}</ref> In addition, the key must also be randomly generated to avoid its recovery through brute-force searches and related-key attacks designed to identify it from the messages transiting the medium.<ref name="Vacca" />
-Some cryptographers distinguish between "message authentication without secrecy" systems -- which allow the intended receiver to verify the source of the message, but don't bother hiding the plaintext contents of the message -- from [[authenticated encryption]] systems.<ref>
+Some cryptographers distinguish between "message authentication without secrecy" systems – which allow the intended receiver to verify the source of the message, but don't bother hiding the plaintext contents of the message – from [[authenticated encryption]] systems.<ref>{{cite book |first1=G. |last1=Longo |first2=M. |last2=Marchi |first3=A. |last3=Sgarro |url=https://books.google.com/books?id=WvYrBAAAQBAJ |title=Geometries, Codes and Cryptography |page=188}}</ref> Some cryptographers have researched [[subliminal channel]] systems that send messages that appear to use a "message authentication without secrecy" system, but in fact also transmit a secret message.
-G. Longo, M. Marchi, A. Sgarro
-[https://books.google.com/books?id=WvYrBAAAQBAJ "Geometries, Codes and Cryptography"].
-p. 188.
-</ref>
-Some cryptographers have researched [[subliminal channel]] systems that send messages that appear to use a "message authentication without secrecy" system, but in fact also transmit a secret message.
 == See also ==