Authentication Theory/Coding Theory
From MaRDI portal
Publication:3695175
DOI10.1007/3-540-39568-7_32zbMATH Open0575.94011OpenAlexW1743965195MaRDI QIDQ3695175FDOQ3695175
Authors: Gustavus J. Simmons 
Publication date: 1985
Published in: Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39568-7_32
Recommendations
Cited In (71)
- Reverse firewalls for adaptively secure MPC without setup
- New bound for affine resolvable designs and its application to authentication codes
- A TWOOA construction for multi-receiver multi-message authentication codes
- Title not available (Why is that?)
- Authentication codes: an area where coding and cryptology meet
- Codeword distinguishability in minimum diversity decoding
- Authentication With Distortion Criteria
- New Family of Non-Cartesian Perfect Authentication Codes
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Geometry of classical groups over finite fields and its applications
- Коды аутентификации с секретностью (обзор)
- Constructions of difference covering arrays.
- A lower bound on authentication after having observed a sequence of messages
- Some constructions and bounds for authentication codes
- Title not available (Why is that?)
- Cryptography and Coding
- Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes
- Authentication theory and hypothesis testing
- Title not available (Why is that?)
- A construction for optimal \(c\)-splitting authentication and secrecy codes
- On the equivalence of authentication codes and robust (2, 2)-threshold schemes
- Three constructions of authentication/secrecy codes
- Economically optimal variable tag length message authentication
- A new class of optimal 3-splitting authentication codes
- Blind coding: authentication frauds from the point of view of rate-distortion theory
- Codes for detection of limited view algebraic tampering
- Title not available (Why is that?)
- Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry
- Complete weight enumerators of some linear codes and their applications
- Association schemes based on singular linear spaces and its applications
- Construction of authentication codes based on orthogonal array and Latin square
- Isomorphism classes of authentication codes
- Subspaces in \(d\)-bounded distance-regular graphs and their applications
- A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
- Multireceiver authentication codes: Models, bounds, constructions, and extensions
- Information-theoretic bounds for authentication codes and block designs
- The solution of some classes of matrix games
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Authentication codes in plaintext and chosen-content attacks
- Universal hash functions from exponential sums over finite fields and Galois rings
- The combinatorics of authentication and secrecy codes
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- New bounds and constructions for authentication/secrecy codes with splitting
- Further results on asymmetric authentication schemes
- Title not available (Why is that?)
- Message authentication with arbitration of transmitter/receiver disputes
- New constructions of systematic authentication codes from three classes of cyclic codes
- On Efficient Message Authentication Via Block Cipher Design Techniques
- Combinatorial characterizations of authentication codes
- A unified and generalized treatment of authentication theory
- Combinational constructions of splitting authentication codes with perfect secrecy
- Keyed hash functions
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- Title not available (Why is that?)
- Association schemes based on singular symplectic geometry over finite fields and its application
- On message authentication with a correlated setup
- Information-theoretic bounds for authentication schemes
- A coding theory construction of new systematic authentication codes
- A-codes from rational functions over Galois rings
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- A construction for authentication/secrecy codes from certain combinatorial designs
- Authentication codes and bipartite graphs
- Incidence structures applied to cryptography
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- Algebraic manipulation detection codes
- Cartesian authentication codes from functions with optimal nonlinearity.
- Quantum authentication with key recycling
- Error-correcting codes for authentication and subliminal channels
- Codes Which Detect Deception
- Unconditionally Secure Approximate Message Authentication
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)
