A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields (Q2336118): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59049345, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Codes Which Detect Deception / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message Authentication with Arbitration of Transmitter/Receiver Disputes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Cartesian authentication codes from unitary geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3641699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of authentication codes from algebraic curves over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authentication schemes from highly nonlinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multireceiver authentication codes: Models, bounds, constructions, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2918620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2846651 / rank
 
Normal rank

Latest revision as of 00:23, 21 July 2024

scientific article
Language Label Description Also known as
English
A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
scientific article

    Statements

    A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields (English)
    0 references
    0 references
    0 references
    19 November 2019
    0 references
    Summary: Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we construct multisender authentication codes with sequential model from symplectic geometry over finite fields, and the parameters and the maximum probabilities of deceptions are also calculated.
    0 references

    Identifiers