Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
The combinatorics of authentication and secrecy codes
Journal of Cryptology
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the construction of perfect authentication codes that permit arbitration
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Combinatorial Characterizations of Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Message authentication with arbitration of transmitter/receiver disputes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Combinatorial Bounds on Authentication Codes with Arbitration
Designs, Codes and Cryptography
Security Notions for Unconditionally Secure Signature Schemes
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Unconditionally Secure Digital Signature Schemes Admitting Transferability
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
A New Class of Optimal 3-splitting Authentication Codes
Designs, Codes and Cryptography
Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
Formal to Practical Security
Combinatorial bounds for authentication codes with arbitration
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
A2-codes from universal hash classes
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Combinatorial Designs for Authentication and Secrecy Codes
Foundations and Trends in Communications and Information Theory
Combinatorial bounds and characterizations of splitting authentication codes
Cryptography and Communications
Crypto topics and applications I
Algorithms and theory of computation handbook
| Hi-index | 0.01 |
For the authentication model with arbitration (A2-code), Johansson showed a lower bound on the size of encoding rules. However, this bound is no longer tight if the size of source states is large. This paper presents a more tight lower bound on the size of encoding rules for large source states. An A2-code is shown which approximately meets the proposed bound, also. Further, we show that the size of encoding rules for the transmitter can be greatly reduced if the receiver's cheating probability is slightly large.