首页> 外文会议>International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes(AAECC-16); 20060220-24; Las Vegas, NV(US) >Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication
【24h】

Unconditionally Secure Chaffing-and-Winnowing: A Relationship Between Encryption and Authentication

机译:无条件安全的交换和风选:加密和身份验证之间的关系

获取原文
获取原文并翻译 | 示例

摘要

A chaffing-and-winnowing is a cryptographic scheme which does not require encryption but instead use a message authentication code (MAC) to provide the same function as encryption. In this paper, we discuss and introduce some new insights in the relationship between unconditionally secure authentication codes (A-code) and unconditionally secure encryption schemes through observing the mechanisms of chaffing-and-winnowing. Particularly, we show through chaffing-and-winnowing that an A-code with a security level considerably low stands equivalently for an encryption scheme with perfect secrecy, and a fully secure authentication scheme implies both perfect secrecy and non-malleability for an encryption scheme in the unconditionally secure setting.
机译:吹牛和吹气是一种加密方案,不需要加密,而是使用消息身份验证代码(MAC)提供与加密相同的功能。在本文中,我们将通过观察颤动和风选机制来讨论和介绍有关无条件安全验证码(A-code)与无条件安全加密方案之间关系的一些新见解。尤其是,我们通过细心研究发现,安全级别相当低的A代码等同于具有完全保密性的加密方案,而完全安全的身份验证方案则意味着在加密方案中既具有完美的保密性又具有不可篡改性。无条件安全设置。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号