Unconditionally Secure Authenticated Encryption with Shorter Keys

被引:0
作者
Alomair, Basel [1 ]
Poovendran, Radha [1 ]
机构
[1] Univ Washington, Dept Elect Engn, Network Secur Lab, Seattle, WA 98195 USA
来源
SECURITY IN INFORMATION SYSTEMS, PROCEEDINGS | 2009年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Confidentiality and integrity are two main objectives of security systems and the literature of cryptography is rich with proposed techniques to achieve them. To satisfy the requirements of a wide range of applications, a variety of techniques with different properties and performances have appeared in the literature. In this work, we address the problem of confidentiality and integrity in communications over public channels. We propose an unconditionally secure authenticated encryption that requires shorter key material than current state of the art. By combining properties of the integer field Z(P), with the fact that the message to be authenticated is unknown to adversaries (encrypted), message integrity is achieved using a single modular multiplication. Against an adversary equipped with a single antenna, the adversary's probability of modifying a valid message in a way undetected by the intended receiver can be made an absolute zero. After the description of the basic scheme and its detailed security analysis are completed, we describe an extension to the main scheme that can substantially reduce the required amount of key material.
引用
收藏
页码:3 / 15
页数:13
相关论文
共 28 条
  • [1] [Anonymous], 4253 RFC
  • [2] [Anonymous], 2001, FDN CRYPTOGRAPHY BAS
  • [3] Bellare M, 1995, LECT NOTES COMPUT SC, V963, P15
  • [4] Bellare M, 2004, LECT NOTES COMPUT SC, V3017, P389
  • [5] Bellare M, 2000, LECT NOTES COMPUT SC, V1976, P531
  • [6] Bellare M., 1996, Advances in Cryptology - CRYPTO'96. 16th Annual International Cryptology Conference. Proceedings, P1
  • [7] BLACK J, 1999, ADV CRYPT CRYPT 99 1
  • [8] Cormen TH, 1999, INTRO ALGORITHMS
  • [9] COVER T, 2006, ELEMENTSD INFORM THE
  • [10] FERGUSON N, 2003, LNCS, V2887