New results on multi-receiver authentication codes
From MaRDI portal
(Redirected from New results on multi-receiver authentication codes)
Recommendations
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Bounds and constructions for multireceiver authentication codes
- scientific article; zbMATH DE number 6707359
- Characterization of (k,n) multi-receiver authentication
- A new construction of multi-sender authentication codes from polynomials over finite fields.
Cited in
(18)- Logarithm Cartesian authentication codes.
- Cartesian authentication codes from functions with optimal nonlinearity.
- Further results on asymmetric authentication schemes
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Ramp secret sharing with cheater identification in presence of rushing cheaters
- Modification tolerant signature schemes: location and correction
- A new construction of multisender authentication codes from polynomials over finite fields
- Lower bounds for multicast message authentication
- An Hybrid Approach for Efficient Multicast Stream Authentication over Unsecured Channels
- A TWOOA construction for multi-receiver multi-message authentication codes
- New results on unconditionally secure multi-receiver manual authentication
- Bounds and constructions for multireceiver authentication codes
- Arbitrated unconditionally secure authentication scheme with multi-senders
- Broadcast authentication in group communication
- Broadcast authentication for group communication
- Hierarchical Secret Sharing Schemes Secure Against Rushing Adversary: Cheater Identification and Robustness
- A survey of cover-free families: constructions, applications, and generalizations
- On cover-free families of finite vector spaces
This page was built for publication: New results on multi-receiver authentication codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249663)
