消息认证(Message Authentication).pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
消息认证(Message Authentication) Goal: A = M = B 1. Guarantee no message changed 2. Confirm the message sent by specified user Authenticator: a short string (value) MAC appended to a message M for authenticating the message Sender: M ? M||MAC Receiver: M||MAC ? yes/no (authentication) Message Encryption message encryption by itself also provides a measure of authentication if symmetric encryption is used then: receiver know sender must have created it since only sender and receiver know key used know content cannot of been altered if message has suitable structure, redundancy or a checksum to detect any changes Encryption for authentication First symmetric encryption: Let M be a message of some bit pattern Eg. M=X||111110000011111 Authenticator: V=EK(M) Authentication Compute DK(V)=M’ Check M’=X’||111110000011111 Encryption for authentication (cont.) Second symmetric encryption Compute a “checksum” (frame check sequence) Let F be a public checksum function Compute C=EK(M||F(M)) Authentication Compute DK(C)=M’||S’ Check S’=F(M’) Encryption for authentication (cont.) Message Encryption if public-key encryption is used: encryption provides no confidence of sender since anyone potentially knows public-key however if sender signs message using their private-key then encrypts with recipients public key have both secrecy and authentication again need to recognize corrupted messages but at cost of two public-key uses on message Message authentication code Prerequisite: A and B shares a key K Can be a session key MAC: a short fixed-size data block, depending on the message M and the shared key K MAC(K,M)=CK(M) Sender: M||CK(M) Receiver: on receiving M’|C’ Compute C’’=CK(M’) Check whether C’=C’’ MAC: example The last block of DES-CBC Cipher block chaining mode MAC: security Only A and B who share a key can create a valid MAC code for a message M Only the designated receiver A or B can authenticate the received message An attacker cannot modif

文档评论(0)

zywx66 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档