Recommendations
Cited in
(84)- Unconditionally Secure Approximate Message Authentication
- Geometry of classical groups over finite fields and its applications
- The circulant hash revisited
- Constructions of difference covering arrays.
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes
- A shift register construction of unconditionally secure authentication codes
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
- Коды аутентификации с секретностью (обзор)
- A lower bound on authentication after having observed a sequence of messages
- Some constructions and bounds for authentication codes
- Variants of Wegman-Carter message authentication code supporting variable tag lengths
- 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
- MMH* with arbitrary modulus is always almost-universal
- A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
- Combinatorial bounds and characterizations of splitting authentication codes
- scientific article; zbMATH DE number 7310202 (Why is no real title available?)
- Perennial secure multi-party computation of universal Turing machine
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
- Optimal forgeries against polynomial-based MACs and GCM
- New hash functions and their use in authentication and set equality
- On modes of operations of a block cipher for authentication and authenticated encryption
- On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
- Construction of Cartesian authentication codes from unitary geometry
- Three constructions of authentication/secrecy codes
- Three constructions of perfect authentication codes from projective geometry over finite fields
- Cryptanalysis of secure message transmission protocols with feedback
- Economically optimal variable tag length message authentication
- Logarithm Cartesian authentication codes.
- Perfect difference systems of sets and Jacobi sums
- Authentication codes for nontrusting parties obtained from rank metric codes
- 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
- On fast and provably secure message authentication based on universal hashing
- Systematic authentication codes using additive polynomials
- The combinatorics of authentication and secrecy codes
- New bounds and constructions for authentication/secrecy codes with splitting
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Universal hash functions from exponential sums over finite fields and Galois rings
- Further results on asymmetric authentication schemes
- A new construction of multisender authentication codes from polynomials over finite fields
- A survey on fast correlation attacks
- What is the Future of Cryptography?
- Message authentication with arbitration of transmitter/receiver disputes
- On Efficient Message Authentication Via Block Cipher Design Techniques
- 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
- Authentication codes: an area where coding and cryptology meet
- Study on the security of the authentication scheme with key recycling in QKD
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- New methods of construction of Cartesian authentication codes from geometries over finite commutative rings
- A trade-off between collision probability and key size in universal hashing using polynomials
- General lower bounds for chosen-content attacks against authentication codes
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- On message authentication with a correlated setup
- Information-theoretic bounds for authentication schemes
- A coding theory construction of new systematic authentication codes
- Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
- Trusted scalable SAT solving with on-the-fly LRAT checking
- Categorization of faulty nonce misuse resistant message authentication
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups
- Singular linear space and its applications
- Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
- Anzahl formulas of subspaces in symplectic spaces and their 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
- A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields
- A class of authentication codes with secrecy
- Incidence structures applied to cryptography
- A new multi-linear universal hash family
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test
- On weak keys and forgery attacks against polynomial-based MAC schemes
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Several Anzahl theorems of alternate matrices over Galois rings
- 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
- Universal hashing and multiple authentication
- On the security of compressed encodings
- Cryptology: The mathematics of secure communication
- Efficient robust secret sharing from expander graphs
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)
