Unconditionally secure chaffing-and-winnowing: a relationship between encryption and authentication

  • Authors:
  • Goichiro Hanaoka;Yumiko Hanaoka;Manabu Hagiwara;Hajime Watanabe;Hideki Imai

  • Affiliations:
  • Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;NTT DoCoMo, Inc., Yokosuka, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan

  • Venue:
  • AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.