Authentication Theory/Coding Theory
From MaRDI portal
Publication:3695175
DOI10.1007/3-540-39568-7_32zbMath0575.94011OpenAlexW1743965195MaRDI QIDQ3695175
Publication date: 1985
Published in: Advances in Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39568-7_32
Related Items (56)
Complete weight enumerators of some linear codes and their applications ⋮ Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings ⋮ Construction of authentication codes based on orthogonal array and Latin square ⋮ Information-theoretic bounds for authentication codes and block designs ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ Some constructions and bounds for authentication codes ⋮ A construction for authentication/secrecy codes from certain combinatorial designs ⋮ Isomorphism classes of authentication codes ⋮ Authentication codes in plaintext and chosen-content attacks ⋮ New Family of Non-Cartesian Perfect Authentication Codes ⋮ Unconditionally Secure Approximate Message Authentication ⋮ Geometry of classical groups over finite fields and its applications ⋮ Construction of Cartesian Authentication Codes from Pseudo Symplectic Geometry ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ Association schemes based on singular symplectic geometry over finite fields and its application ⋮ 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 ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Subspaces in \(d\)-bounded distance-regular graphs and their applications ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ Reverse firewalls for adaptively secure MPC without setup ⋮ A TWOOA construction for multi-receiver multi-message authentication codes ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ Algebraic manipulation detection codes ⋮ The combinatorics of authentication and secrecy codes ⋮ A Cartesian product construction for unconditionally secure authentication codes that permit arbitration ⋮ Constructions of difference covering arrays. ⋮ Information-theoretic bounds for authentication schemes ⋮ Codes for Detection of Limited View Algebraic Tampering ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ Complete weight enumerators of two classes of linear codes ⋮ On Efficient Message Authentication Via Block Cipher Design Techniques ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Authentication codes and bipartite graphs ⋮ THE SOLUTION OF SOME CLASSES OF MATRIX GAMES ⋮ Incidence structures applied to cryptography ⋮ Combinatorial characterizations of authentication codes ⋮ A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields ⋮ A coding theory construction of new systematic authentication codes ⋮ A new class of optimal 3-splitting authentication codes ⋮ A-codes from rational functions over Galois rings ⋮ 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 ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ Коды аутентификации с секретностью (обзор) ⋮ Keyed hash functions ⋮ Message Authentication with Arbitration of Transmitter/Receiver Disputes ⋮ Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ Further results on asymmetric authentication schemes ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ A lower bound on authentication after having observed a sequence of messages ⋮ Association schemes based on singular linear spaces and its applications ⋮ Quantum Authentication with Key Recycling
This page was built for publication: Authentication Theory/Coding Theory
