New combinatorial designs and their applications to authentication codes and secret sharing schemes.
From MaRDI portal
Publication:1428540
DOI10.1016/S0012-365X(03)00283-8zbMath1044.94013MaRDI QIDQ1428540
Kaoru Kurosawa, Hajime Saido, Wakaha Ogata, Douglas R. Stinson
Publication date: 29 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
balanced incomplete block designcombinatorial designdifference familyauthentication codesecret sharing scheme
Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Authentication, digital signatures and secret sharing (94A62)
Related Items (38)
Existence on splitting-balanced block designs with resolvability ⋮ Three constructions of perfect authentication codes from projective geometry over finite fields ⋮ Construction and nonexistence of strong external difference families ⋮ Resolvable generalized difference matrices: existence and applications ⋮ Constructions of external difference families and disjoint difference families ⋮ A construction for optimal \(c\)-splitting authentication and secrecy codes ⋮ A note on difference families from cyclotomy ⋮ Combinatorial bounds and characterizations of splitting authentication codes ⋮ Near-complete external difference families ⋮ Existence and non-existence results for strong external difference families ⋮ Combinational constructions of splitting authentication codes with perfect secrecy ⋮ External Difference Families from Finite Fields ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ Optimal difference systems of sets and partition-type cyclic difference packings ⋮ Disjoint difference families and their applications ⋮ Algebraic manipulation detection codes ⋮ Weighted external difference families and R-optimal AMD codes ⋮ Nonexistence of strong external difference families in abelian groups of order being product of at most three primes ⋮ Constructions of partitioned difference families ⋮ A new class of 3-fold perfect splitting authentication codes ⋮ New existence and nonexistence results for strong external difference families ⋮ Some new classes of 2-fold optimal or perfect splitting authentication codes ⋮ A generalization of combinatorial designs and related codes ⋮ Efficient robust secret sharing from expander graphs ⋮ Splitting balanced incomplete block designs with block size 3 × 2 ⋮ Cyclotomic constructions of external difference families and disjoint difference families ⋮ A new class of splitting 3-designs ⋮ Further results on the existence of splitting BIBDs and application to authentication codes ⋮ A new class of optimal 3-splitting authentication codes ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Some series of optimal multilength OOCs of weight four ⋮ Strong external difference families in abelian and non-abelian groups ⋮ Partial Geometric Difference Families ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ Perfect difference systems of sets and Jacobi sums ⋮ Partial geometric designs from group actions ⋮ ON THE EMBEDDING OF GROUPS AND DESIGNS IN A DIFFERENCE BLOCK DESIGN ⋮ Internal and external partial difference families and cyclotomy
Cites Work
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- How to share a secret with cheaters
- New bounds and constructions for authentication/secrecy codes with splitting
- On a fallacious bound for authentication codes
- Optimum Secret Sharing Scheme Secure against Cheating
- Authentication Theory/Coding Theory
- Lower bounds on the probability of deception in authentication with arbitration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New combinatorial designs and their applications to authentication codes and secret sharing schemes.
