A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields

DOI10.1155/2013/602539MaRDI QIDQ364440zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Xiuli Wang

Publication date 9 September 2013

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/602539

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Review text

Summary: Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one multisender authentication code from pseudosymplectic geometry over finite fields. The parameters and the probabilities of deceptions of this code are also computed.

Recommendations

• A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
• A new construction of multisender authentication codes from symplectic geometry over finite fields.
• A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
• scientific article; zbMATH DE number 6843227
• A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields

Cites work

• Codes Which Detect Deception
• scientific article; zbMATH DE number 6707359 (Why is no real title available?)
• scientific article; zbMATH DE number 1107681 (Why is no real title available?)
• Two constructions of multireceiver authentication codes from symplectic geometry over finite fields

Cited in

(10)

• A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
• A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
• A new construction of multisender authentication codes from polynomials over finite fields
• A new construction of multisender authentication codes with simultaneous model from singular symplectic geometry over finite fields.
• A new construction of multi-sender authentication codes from polynomials over finite fields.
• One construction of multireceiver authentication codes from pseudo-symplectic geometry over finite fields.
• A new construction of multisender authentication codes from symplectic geometry over finite fields.
• A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
• scientific article; zbMATH DE number 6843227 (Why is no real title available?)
• A new construction of multi-receiver authentication codes from pseudo-symplectic geometry over finite fields.

This page was built for publication: A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364440)