On optimal weak algebraic manipulation detection codes and weighted external difference families
From MaRDI portal
Publication:780376
DOI10.1007/S10623-020-00754-7zbMATH Open1448.94247arXiv1905.01412OpenAlexW3015644121MaRDI QIDQ780376FDOQ780376
Publication date: 15 July 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: This paper provides a combinatorial characterization of weak algebraic manipulation detection (AMD) codes via a kind of generalized external difference families called bounded standard weighted external difference families (BSWEDFs). By means of this characterization, we improve a known lower bound on the maximum probability of successful tampering for the adversary's all possible strategies in weak AMD codes. We clarify the relationship between weak AMD codes and BSWEDFs with various properties. We also propose several explicit constructions for BSWEDFs, some of which can generate new optimal weak AMD codes.
Full work available at URL: https://arxiv.org/abs/1905.01412
Recommendations
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Weighted external difference families and R-optimal AMD codes
- Optimal algebraic manipulation detection codes in the constant-error model
- On generalised AMD codes
- Algebraic manipulation detection codes via highly nonlinear functions
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Optimal and perfect difference systems of sets
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- Combinatorial problems motivated by comma‐free codes
- From a 1-rotational RBIBD to a partitioned difference family
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Disjoint difference families and their applications
- Algebraic manipulation detection codes
- Detection of Algebraic Manipulation in the Presence of Leakage
- High-Rate Self-Synchronizing Codes
- Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
- Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
- Weighted external difference families and R-optimal AMD codes
- Cyclotomic construction of strong external difference families in finite fields
- New existence and nonexistence results for strong external difference families
- Some results on generalized strong external difference families
- Characterising bimodal collections of sets in finite groups
- Existence and non-existence results for strong external difference families
- Construction and nonexistence of strong external difference families
- A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
Cited In (4)
- Algebraic manipulation detection codes via highly nonlinear functions
- Nonexistence of strong external difference families in abelian groups of order being product of at most three primes
- Some Nonexistence Results for Strong External Difference Families Using Character Theory
- Weighted external difference families and R-optimal AMD codes
This page was built for publication: On optimal weak algebraic manipulation detection codes and weighted external difference families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780376)
