Lower bounds on the probability of deception in authentication with arbitration
From MaRDI portal
Publication:4324126
DOI10.1109/18.333869zbMath0814.94012OpenAlexW2096470138MaRDI QIDQ4324126
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://lup.lub.lu.se/record/1157117
unconditional securitylower boundsauthentication codesarbitrationinformation-theoretic bounds\(A^ 2\)-codes
Related Items (14)
Construction of authentication codes with double arbiters over symplectic geometry ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ GOB designs for authentication codes with arbitration ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ A construction for \(t\)-fold perfect authentication codes with arbitration ⋮ New bound for affine resolvable designs and its application to authentication codes ⋮ New combinatorial designs and their applications to authentication codes and secret sharing schemes. ⋮ Further results on the existence of splitting BIBDs and application to authentication codes ⋮ A new class of optimal 3-splitting authentication codes ⋮ The power of primes: security of authentication based on a universal hash-function family ⋮ On the construction of authentication codes that permit arbitration over projective spaces ⋮ On \((t, L)\)-fold perfect authentication and secrecy codes with arbitration ⋮ Further results on asymmetric authentication schemes ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions
This page was built for publication: Lower bounds on the probability of deception in authentication with arbitration
