A key predistribution scheme based on rational normal curves over finite fields (Q2712470)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A key predistribution scheme based on rational normal curves over finite fields |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A key predistribution scheme based on rational normal curves over finite fields |
scientific article |
Statements
9 December 2002
0 references
rational normal curve
0 references
strong partially balanced design
0 references
key predistribution scheme
0 references
A key predistribution scheme based on rational normal curves over finite fields (English)
0 references
In 1993, \textit{A. Beimel} and \textit{B. Chor} [Adv. Cryptology -- CRYPTO '93, Lect. Notes Comput. Sci. 773, 444-455 (1994; Zbl 0870.94023)] first proposed the key predistribution scheme (KPS). \textit{D. Stinson} [Des. Codes Cryptography 12, 215-243 (1997; Zbl 0880.94009); with \textit{Tran Van Trung}, ibid. 14, 261-279 (1998; Zbl 1125.94331); and with \textit{C. Blundo} and \textit{L. Mattos}, Theor. Comput. Sci. 200, 313-334 (1998; Zbl 0917.68060))] summarized and decribed some methods of constructing KPS. In this paper, using \textit{D. Pei}'s result on a family of strong partially balanced \(t\)-designs [A problem of combinatorial designs related to authentication codes, J. Comb. Des. 6, 417-429 (1998; Zbl 0960.05025)], the authors propose a new class of KPS.
0 references
