Disjoint difference families and their applications
From MaRDI portal
Publication:908044
DOI10.1007/s10623-015-0149-4zbMath1355.94106arXiv1509.05255OpenAlexW2240701896WikidataQ59476875 ScholiaQ59476875MaRDI QIDQ908044
Siaw-Lynn Ng, Maura B. Paterson
Publication date: 2 February 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05255
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Applications of design theory to circuits and networks (94C30) Combinatorial structures in finite projective spaces (51E20) Authentication, digital signatures and secret sharing (94A62)
Related Items (6)
A note on difference families from cyclotomy ⋮ Disjoint difference families from Galois rings ⋮ Near-complete external difference families ⋮ Existence and non-existence results for strong external difference families ⋮ On optimal weak algebraic manipulation detection codes and weighted external difference families ⋮ Internal and external partial difference families and cyclotomy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new class of splitting 3-designs
- Combinatorial bounds and characterizations of splitting authentication codes
- A new class of 3-fold perfect splitting authentication codes
- Complete sets of disjoint difference families and their applications
- Three constructions of authentication codes with perfect secrecy
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Further results on the existence of splitting BIBDs and application to authentication codes
- Restrictions and generalizations on comma-free codes
- How to share a secret with cheaters
- On a fallacious bound for authentication codes
- Cyclic Whist tournaments
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Secret sharing schemes with detection of cheaters for a general access structure
- Almost optimum secret sharing schemes with cheating detection for random bit strings
- Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes
- Construction of optimal sets of frequency hopping sequences
- A new frequency-hopping sequence set based upon generalized cyclotomy
- Algebraic manipulation detection codes
- Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
- A new class of optimal 3-splitting authentication codes
- Detection of Algebraic Manipulation in the Presence of Leakage
- New Families of Optimal Frequency Hopping Sequence Sets
- Non-Overlapping Codes
- High-Rate Self-Synchronizing Codes
- Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
- Almost Optimum t-Cheater Identifiable Secret Sharing Schemes
- Combinatorial Designs for Authentication and Secrecy Codes
- Optimal Rate Code Constructions for Computationally Simple Channels
- Comma-Free Codes
- Information-Theoretic Security Without an Honest Majority
- Optimal Frequency-Hopping Sequences Via Cyclotomy
- Optimal Frequency Hopping Sequences: A Combinatorial Approach
- Lower Bounds on the Hamming Auto- and Cross Correlations of Frequency-Hopping Sequences
- Flaws in Some Secret Sharing Schemes Against Cheating
- Optical orthogonal codes: design, analysis and applications
- Families of sequences with optimal Hamming-correlation properties
- Non-Malleable Codes
- Combinatorial problems motivated by comma‐free codes
- Constructions for optimal constant weight cyclically permutable codes and difference families
- Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes
- Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
- Optimum PN Sequences for CDMA Systems
- Cheating Detectable Secret Sharing Schemes Supporting an Arbitrary Finite Field
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
- Design of Strongly Secure Communication and Computation Channels by Nonlinear Error Detecting Codes
- Combinatorial Constructions for Optimal Two-Dimensional Optical Orthogonal Codes With $\lambda=2$
- General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
- Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
- Optimum Secret Sharing Scheme Secure against Cheating
- Combinatorial bounds on authentication codes with arbitration.
This page was built for publication: Disjoint difference families and their applications
