Probabilistic Existence Results for Parent-Identifying Schemes

06/03/2019
by   Yujie Gu, et al.
0

Parent-identifying schemes provide a way to identify causes from effects for some information systems such as digital fingerprinting and group testing. In this paper, we consider combinatorial structures for parent-identifying schemes. First, we establish an equivalent relationship between parent-identifying schemes and forbidden configurations. Based on this relationship, we derive probabilistic existence lower bounds for two related combinatorial structures, that is, t-parent-identifying set systems (t-IPPS) and t-multimedia parent-identifying codes (t-MIPPC), which are used in broadcast encryption and multimedia fingerprinting respectively. The probabilistic lower bound for the maximum size of a t-IPPS has the asymptotically optimal order of magnitude in many cases, and that for t-MIPPC provides the asymptotically optimal code rate when t=2 and the best known asymptotic code rate when t≥ 3. Furthermore, we analyze the structure of 2-IPPS and prove some bounds for certain cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2021

Improved Lower Bounds for Secure Codes and Related Structures

Secure codes are widely-studied combinatorial structures which were intr...
research
02/05/2023

Secure Codes with List Decoding

In this paper we consider combinatorial secure codes in traitor tracing ...
research
08/22/2019

Beating the probabilistic lower bound on perfect hashing

For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code ove...
research
03/15/2019

New bounds and constructions for constant weighted X-codes

As a crucial technique for integrated circuits (IC) test response compac...
research
08/20/2021

Complete Traceability Multimedia Fingerprinting Codes Resistant to Averaging Attack and Adversarial Noise with Optimal Rate

In this paper we consider complete traceability multimedia fingerprintin...
research
02/21/2018

Path-Based Function Embedding and its Application to Specification Mining

Relationships among program elements is useful for program understanding...
research
11/18/2020

Engineering a Fast Probabilistic Isomorphism Test

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism te...

Please sign up or login with your details

Forgot password? Click here to reset