New combinatorial designs and their applications to authentication codes and secret sharing schemes
Authors:
- 1 March 2004
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 279 (1-3) , 383-405
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the Construction of Perfect Authentication Codes that Permit Arbitration2001
- New Bound on Authentication Code with Arbitration2001
- Arbitrated Unconditionally Secure Authentication Can Be Unconditionally Protected against Arbiter’s Attacks2001
- Authentication Theory/Coding Theory2000
- On a Fallacious Bound for Authentication CodesJournal of Cryptology, 1999
- CRC Handbook of Combinatorial Designs1996
- Optimum Secret Sharing Scheme Secure against Cheating1996
- Combinatorial Bounds for Authentication Codes with Arbitration1995
- Lower bounds on the probability of deception in authentication with arbitrationIEEE Transactions on Information Theory, 1994
- New bounds and constructions for authentication/secrecy codes with splittingJournal of Cryptology, 1991