Linear authentication codes: bounds and constructions (original) (raw)
Related papers
Three constructions of authentication/secrecy codes
Journal of Pure and Applied Algebra, 2005
New results on multi-receiver authentication codes
1998
PAPER Coding Theorems for Secret-Key Authentication Systems
Bounds and constructions for multireceiver authentication codes
1998
Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
Information and Computation, 1999
Coding theorems for secret-key authentication systems
Lower Bound on Linear Authenticated Encryption
Lecture Notes in Computer Science, 2004
Some remarks on authentication systems
Lecture Notes in Computer Science, 2000
Generalized Subspace Subcodes With Application in Cryptology
IEEE Transactions on Information Theory, 2019
Codes with few weights arising from linear sets
Advances in Mathematics of Communications, 2019
Public-Key Cryptosystems Based on Linear Codes
IMA Conference on Cryptography and Coding, 1995
Secure-broadcast codes over linear-deterministic channels
2010 IEEE International Symposium on Information Theory, 2010
Informational Divergence Bounds for Authentication Codes
Theory and Application of Cryptographic Techniques, 1989
Bounds and characterizations of authentication/secrecy schemes
Designs, codes and cryptography, 1998
Constructions of authentication codes from algebraic curves over finite fields
IEEE Transactions on Information Theory, 2000
Optimal non-projective linear codes constructed from down-sets
Discrete Applied Mathematics, 2019
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
Advances in Cryptology — ASIACRYPT 2001, 2001
On the Composition of Secret Sharing Schemes Related to Codes
Discrete Mathematics, Algorithms and Applications, 2014
Algebraic Message Authentication Codes
Computational Hardness and Explicit Constructions of Error Correcting Codes
Fourty-Fourth Annual …, 2006
Vectorial Boolean functions and linear codes in the context of algebraic attacks
2017
Information-Theoretic Bounds for Authentication Frauds
Lecture Notes in Computer Science, 1993
On the Bounds of certain Maximal Linear Codes in a Projective Space.
A ug 2 02 1 Some hypersurfaces over finite fields , minimal codes and secret sharing schemes
2021
IEEE Transactions on Information Forensics and Security, 2015
The Lattice Structure of Linear Subspace Codes
ArXiv, 2019
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors
ArXiv, 2020
Minimal vectors in linear codes
IEEE Transactions on Information Theory, 1998
Restricted linear congruences and an authenticated encryption scheme
Signing a Linear Subspace: Signature Schemes for Network Coding
Lecture Notes in Computer Science, 2009