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