On optimal weak algebraic manipulation detection codes and weighted external difference families

DOI10.1007/S10623-020-00754-7MaRDI QIDQ780376zbMATH OpenOpenAlexFDO

Authors Minfeng Shao, Ying Miao

Publication date 15 July 2020

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.01412

zbMATH Keywords

algebraic manipulation detection codedifference familyweighted external difference family

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Authentication, digital signatures and secret sharing (94A62)

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.

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

Cites work

• A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
• Algebraic manipulation detection codes
• Characterising bimodal collections of sets in finite groups
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
• Combinatorial problems motivated by comma‐free codes
• Construction and nonexistence of strong external difference families
• Cyclotomic construction of strong external difference families in finite fields
• Detection of algebraic manipulation in the presence of leakage
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Disjoint difference families and their applications
• Existence and non-existence results for strong external difference families
• From a 1-rotational RBIBD to a partitioned difference family
• High-Rate Self-Synchronizing Codes
• New existence and nonexistence results for strong external difference families
• Optimal algebraic manipulation detection codes in the constant-error model
• Optimal and perfect difference systems of sets
• Optimal Constant Composition Codes From Zero-Difference Balanced Functions
• Some Nonexistence Results for Strong External Difference Families Using Character Theory
• Some results on generalized strong external difference families
• Weighted external difference families and R-optimal AMD codes

Cited in

(5)

• Weighted external difference families and R-optimal AMD codes
• 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
• Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families

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)