Broadcast authentication with practically unbounded one-way chains

被引：4

作者：

Groza, Bogdan ^{[1
]}

机构：

[1] Politechnica University of Timisoara, Faculty of Automatics and Computers, Timisoara

来源：

Journal of Software | 2008年 / 3卷 / 03期

关键词：

Authentication; Broadcast; One-way chain; Protocol;

D O I：

10.4304/jsw.3.3.11-20

中图分类号：

学科分类号：

摘要：

A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains constructed with the squaring function which gives the possibility to construct a one-way chain of whose length is unbounded in practice. Although the computational cost is somewhat increased, compared to the use of hash chains, these computational requirements are affordable for the addressed scenario. In brief, the protocol assures information authenticity at the reduced cost of almost one modular multiplication for each broadcasted packet. Time synchronization issues are discussed and the security of the protocol is equivalent to the integer factorization problem since the squaring function is used in the construction of the one-way chain. A failure mode analysis of the protocol is done; this is an aspect of novelty and applies to other protocols based on time synchronization as well. Also a formal proof on the security of the protocol is sketched. © 2008 Academy Publisher.

引用

页码：11 / 20

页数：9

共 25 条

[1]

Anderson R., Bergadano F., Crispo B., Lee J.H., Manifavas C., Needham R., A New Family of Authentication Protocols, ACM Operating Systems Review, pp. 9-20, (1999)

[2]

Bellare M., Rogaway P., Random oracles are practical: A paradigm for designing efficient protocols, ACM Conference on Computer and Communications Security, pp. 62-73, (1993)

[3]

Bergadano F., Cavagnino D., Crispo B., Individual Authentication in Multiparty Communications, Computers & Security Journal, 21, 8, pp. 719-735, (2002)

[4]

Bentley J.P., An Introduction to Reliability and Quality Engineering, (1998)

[5]

Blum L., Blum M., Shub M., Comparison of Two Pseudo-Random Number Generators, Advances in Cryptology Proceedings of Crypto, 82, pp. 61-78, (1982)

[6]

Blum L., Blum M., Shub M., A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, 15, 2, pp. 364-383, (1986)

[7]

Coppersmith D., Jakobsson M., Almost Optimal Hash Sequence Traversal, Proceedings of the Fifth International Conference on Financial Cryptography, pp. 102-119, (2002)

[8]

Groza B., Using one-way chains to provide message authentication without shared secrets, Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing, pp. 82-87, (2006)

[9]

Groza B., Dragomir T.-L., Petrica D., Using the discrete squaring function in the delayed message authentication protocol, International Conference on Internet Surveillance and Protection, (2006)

[10]

Groza B., Broadcast authentication protocol with time synchronization and quadratic residues chains, Second International Conference on Availability, Reliability and Security, pp. 550-557, (2007)

← 1 2 3 →