Authentication Theory/Coding Theory
From MaRDI portal
Recommendations
Cited in
(80)- Some constructions and bounds for authentication codes
- A construction for authentication/secrecy codes from certain combinatorial designs
- New bounds and constructions for authentication/secrecy codes with splitting
- Incidence structures applied to cryptography
- Combinatorial characterizations of authentication codes
- On a fallacious bound for authentication codes
- A lower bound on authentication after having observed a sequence of messages
- Geometry of classical groups over finite fields and its applications
- Bounds and characterizations of authentication/secrecy schemes
- Authentication, identification and pairwise separated measures
- Cartesian authentication codes from functions with optimal nonlinearity.
- Constructions of difference covering arrays.
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- A coding theory construction of new systematic authentication codes
- Three constructions of authentication/secrecy codes
- New constructions of systematic authentication codes from three classes of cyclic codes
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- Further results on asymmetric authentication schemes
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Information-theoretic bounds for authentication codes and block designs
- Authentication codes in plaintext and chosen-content attacks
- Association schemes based on singular symplectic geometry over finite fields and its application
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- Construction of authentication codes based on orthogonal array and Latin square
- A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
- Association schemes based on singular linear spaces and its applications
- Subspaces in \(d\)-bounded distance-regular graphs and their applications
- Algebraic manipulation detection codes
- A new class of optimal 3-splitting authentication codes
- A-codes from rational functions over Galois rings
- Combinational constructions of splitting authentication codes with perfect secrecy
- Blind coding: authentication frauds from the point of view of rate-distortion theory
- Codes for detection of limited view algebraic tampering
- Complete weight enumerators of some linear codes and their applications
- Error-correcting codes for authentication and subliminal channels
- Коды аутентификации с секретностью (обзор)
- Universal hash functions from exponential sums over finite fields and Galois rings
- scientific article; zbMATH DE number 4148026 (Why is no real title available?)
- scientific article; zbMATH DE number 4158546 (Why is no real title available?)
- A TWOOA construction for multi-receiver multi-message authentication codes
- Authentication With Distortion Criteria
- scientific article; zbMATH DE number 67089 (Why is no real title available?)
- Codes Which Detect Deception
- Authentication theory and hypothesis testing
- scientific article; zbMATH DE number 1504674 (Why is no real title available?)
- A unified and generalized treatment of authentication theory
- Authentication codes: an area where coding and cryptology meet
- Isomorphism classes of authentication codes
- Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry
- scientific article; zbMATH DE number 826072 (Why is no real title available?)
- Message authentication with arbitration of transmitter/receiver disputes
- The solution of some classes of matrix games
- scientific article; zbMATH DE number 3893245 (Why is no real title available?)
- scientific article; zbMATH DE number 4193604 (Why is no real title available?)
- Keyed hash functions
- Quantum authentication with key recycling
- Codeword distinguishability in minimum diversity decoding
- New Family of Non-Cartesian Perfect Authentication Codes
- Unconditionally Secure Approximate Message Authentication
- On Efficient Message Authentication Via Block Cipher Design Techniques
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Economically optimal variable tag length message authentication
- Cryptography and Coding
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- New bound for affine resolvable designs and its application to authentication codes
- Reverse firewalls for adaptively secure MPC without setup
- Guarding the signal: secure messaging with reverse firewalls
- Complete weight enumerators of few-weight linear codes
- Key exchange in the post-Snowden era: universally composable subversion-resilient PAKE
- Algorithm substitution attacks on symmetric encryption: a survey
- Construction of an optimal (k,n) multi-receiver authentication code based on orthogonal arrays
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- On message authentication with a correlated setup
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- The combinatorics of authentication and secrecy codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Information-theoretic bounds for authentication schemes
- Authentication codes and bipartite graphs
This page was built for publication: Authentication Theory/Coding Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3695175)
