Codes Which Detect Deception

DOI10.1002/j.1538-7305.1974.tb02751.xzbMath0275.94006OpenAlexW2028732372MaRDI QIDQ4401320

F. J. MacWilliams, N. J. A. Sloane, E. N. Gilbert

Publication date: 1974

Published in: Bell System Technical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/j.1538-7305.1974.tb02751.x

Mathematics Subject Classification ID

Other types of codes (94B60)

Related Items (83)

MMH* with arbitrary modulus is always almost-universal ⋮ ON "THE POWER OF VERIFICATION QUERIES" IN UNCONDITIONALLY SECURE MESSAGE AUTHENTICATION ⋮ Variants of Wegman-Carter message authentication code supporting variable tag lengths ⋮ Essentiallys-fold secure authentication systems of levell ⋮ Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ On modes of operations of a block cipher for authentication and authenticated encryption ⋮ A new construction of multisender authentication codes from polynomials over finite fields ⋮ Universal Hashing and Multiple Authentication ⋮ Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings ⋮ On Fast and Provably Secure Message Authentication Based on Universal Hashing ⋮ Construction of authentication codes based on orthogonal array and Latin square ⋮ A survey on fast correlation attacks ⋮ Study on the security of the authentication scheme with key recycling in QKD ⋮ Optimal forgeries against polynomial-based MACs and GCM ⋮ Authentication codes for nontrusting parties obtained from rank metric codes ⋮ Some constructions and bounds for authentication codes ⋮ A construction for authentication/secrecy codes from certain combinatorial designs ⋮ Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes ⋮ Unconditionally Secure Approximate Message Authentication ⋮ A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields ⋮ A new multi-linear universal hash family ⋮ Geometry of classical groups over finite fields and its applications ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes ⋮ Unconditional Byzantine agreement for any number of faulty processors ⋮ Logarithm Cartesian authentication codes. ⋮ A generalization of the formulas for intersection numbers of dual polar association schemes and their applications ⋮ Cartesian authentication codes from functions with optimal nonlinearity. ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ Categorization of faulty nonce misuse resistant message authentication ⋮ On weak keys and forgery attacks against polynomial-based MAC schemes ⋮ On message authentication with a correlated setup ⋮ A trade-off between collision probability and key size in universal hashing using polynomials ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ A class of authentication codes with secrecy ⋮ New hash functions and their use in authentication and set equality ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ A construction for authentication/secrecy codes from 3-homogeneous permutation groups ⋮ Authentication codes: An area where coding and cryptology meet ⋮ Singular linear space and its applications ⋮ Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields ⋮ 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 ⋮ On Efficient Message Authentication Via Block Cipher Design Techniques ⋮ New bounds and constructions for authentication/secrecy codes with splitting ⋮ Authentication codes and bipartite graphs ⋮ Error-correcting codes and cryptography ⋮ Perennial secure multi-party computation of universal Turing machine ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Efficient robust secret sharing from expander graphs ⋮ On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers ⋮ Incidence structures applied to cryptography ⋮ Construction of Cartesian authentication codes from unitary geometry ⋮ 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 ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ Three constructions of authentication/secrecy codes ⋮ Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector ⋮ New methods of construction of Cartesian authentication codes from geometries over finite commutative rings ⋮ The circulant hash revisited ⋮ What is the Future of Cryptography? ⋮ Systematic authentication codes using additive polynomials ⋮ Cryptology: The mathematics of secure communication ⋮ Коды аутентификации с секретностью (обзор) ⋮ Generalised dual arcs and Veronesean surfaces, with applications to cryptography ⋮ EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC ⋮ Perfect difference systems of sets and Jacobi sums ⋮ Message Authentication with Arbitration of Transmitter/Receiver Disputes ⋮ Unnamed Item ⋮ Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk) ⋮ On designs in compact metric spaces and a universal bound on their size ⋮ A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ General lower bounds for chosen-content attacks against authentication codes ⋮ Several Anzahl theorems of alternate matrices over Galois rings ⋮ Further results on asymmetric authentication schemes ⋮ Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields ⋮ A lower bound on authentication after having observed a sequence of messages ⋮ On the Security of Compressed Encodings ⋮ A shift register construction of unconditionally secure authentication codes

This page was built for publication: Codes Which Detect Deception