New bound for affine resolvable designs and its application to authentication codes

DOI10.1007/bfb0030844zbMath1527.05032MaRDI QIDQ6085716

Kaoru Kurosawa, Sanpei Kageyama

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Other designs, configurations (05B30) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some properties on resolvability of variance-balanced designs
• A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
• Resolvability of block designs
• On resolutions and Bose's theorem
• On \(\mu\)-resolvable and affine \(\mu\)-resolvable balanced incomplete block designs
• On resolvable and affine resolvable variance-balanced designs
• Authentication Theory/Coding Theory
• Lower bounds on the probability of deception in authentication with arbitration

This page was built for publication: New bound for affine resolvable designs and its application to authentication codes