A New Construction of Multi-receiver Authentication Codes from Pseudo-Symplectic Geometry over Finite Fields

被引：0

作者：

Wang, Xiuli ^{[1
]}

机构：

[1] Civil Aviat Univ China, Coll Sci, Tianjin 300300, Peoples R China

来源：

ARS COMBINATORIA | 2014年 / 114卷

关键词：

pseudo-symplectic geometry; multi-receiver authentication codes; finite fields;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Multi-receiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we construct one multi-receiver authentication codes from pseudo-symplectic geometry over finite fields. The parameters and the probabilities of deceptions of this codes are also computed.

引用

页码：41 / 51

页数：11

共 8 条

[1] Chen SD, 2011, ARS COMBINATORIA, V99, P193
[2] DESMEDT Y, 1992, IEEE INFOCOM SER, P2045, DOI 10.1109/INFCOM.1992.263476
[3] Li Xi-yang, 2008, Computer Engineering, V34, P138
[4] Bounds and combinatorial structure of (k,n) multi-receiver A-codes
Obana, S
Kurosawa, K
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2001, 22 (01) : 47 - 63
[5] Safavi-Naini R, 1998, LECT NOTES COMPUT SC, V1403, P527, DOI 10.1007/BFb0054151
[6] Multireceiver authentication codes: Models, bounds, constructions, and extensions
Safavi-Naini, R
Wang, H
[J]. INFORMATION AND COMPUTATION, 1999, 151 (1-2) : 148 - 172
[7] SIMMONS GJ, 1987, LECT NOTES COMPUTER, V304, P151
[8] Wan Z., 2002, GEOMETRY CLASSICAL G

← 1 →