On 2-parent-identifying set systems of block size 4

Yujie Gu, Shohei Satake

Research output: Contribution to journalArticlepeer-review

Abstract

Parent-identifying set system is a kind of combinatorial structures with applications to broadcast encryption. In this paper we investigate the maximum number of blocks I2(n, 4) in a 2-parent-identifying set system with ground set size n and block size 4. The previous best-known lower bound states that I2(n, 4) = Ω(n4/3+o(1)). We improve this lower bound by showing that I2(n, 4) = Ω(n3/2-o(1)) using techniques in additive number theory.

Original languageEnglish
Pages (from-to)2067-2076
Number of pages10
JournalDesigns, Codes, and Cryptography
Volume88
Issue number10
DOIs
Publication statusPublished - Oct 1 2020
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On 2-parent-identifying set systems of block size 4'. Together they form a unique fingerprint.

Cite this