Authentication Codes Based on Association Schemes

スポンサーリンク

概要

• 論文の詳細を見る

• This paper discusses the problem of reducing the number of keys required to authenticate a source state (plaintext),as well as introducing a new way of constructing authentication codes. The construction uses association schemes, which are well-defined schemes in combinatorial design theory. The association scheme on the message (ciphertext) space is established by defining two relations between any two messages: The 1st relation is when the two messages do not share a common key, and the 2nd relation is when they do. Using association schemes of the triangular and group divisible types, we are able to reduce the number of keys.

• 社団法人電子情報通信学会の論文
• 1996-01-25

著者

• Tsujii Shigeo

  Faculty Of Engineering Tokyo Institute Of Technology

• Kurosawa Kaoru

  Faculty Of Engineering Tokyo Institute Of Technology

• SONG Youjin

  Electronics and Telecommunications Research Institute

関連論文

• Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
• Attack on Yagisawa Cryptosystem (Special Section on Cryptography and Information Security)
• Towards Secure and Fast Hash Functions
• 4-Move Perfect ZKIP for Some Promise Problems
• A Secure Broadcast Communication Method with Short Messages (Special Section on Information Theory and Its Applications)
• On Claw Free Families (Special Section on Cryptography and Information Security)
• New ElGamal Type Threshold Digital Signature Scheme (Special Section on Cryptography and Information Security)
• Authentication Codes Based on Association Schemes
• A Key Distribution Protocol for Mobile Communication Systems

スポンサーリンク