scientific article; zbMATH DE number 1394290
From MaRDI portal
Publication:4934703
Recommendations
- On the cardinality of systematic authentication codes via error-correcting codes
- scientific article; zbMATH DE number 1857521
- Linear authentication codes: bounds and constructions
- Two constructions of A^2-codes with secrecy from polynomials over finite fields
- Authentication codes: an area where coding and cryptology meet
Cited in
(13)- Authentication codes for nontrusting parties obtained from rank metric codes
- Authentication codes in plaintext and chosen-content attacks
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Weakly biased arrays, almost independent arrays and error-correcting codes
- Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes
- A new multi-linear universal hash family
- Authentication codes: an area where coding and cryptology meet
- Direct proof of security of Wegman-Carter authentication with partially known key
- On the cardinality of systematic authentication codes via error-correcting codes
- Four-state non-malleable codes with explicit constant rate
- Three systems for shared generation of authenticators
- Efficient robust secret sharing from expander graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934703)
