Bounds for Binary Multimedia Codes with the Identifiable Parent Property

Hongna Yang; Yujie Gu; Yiwei Zhang

doi:10.1109/ISIT54713.2023.10206524

Bounds for Binary Multimedia Codes with the Identifiable Parent Property

Hongna Yang, Yujie Gu, Yiwei Zhang

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Multimedia codes with the identifiable parent property (MIPPCs) were proposed to resist collusion attacks for multimedia fingerprinting. However, the largest possible code rate of binary MIPPCs is far from being understood yet. In this paper, we aim to establish lower and upper bounds for the largest code rate of binary MIPPCs. To that end, we introduce a new concept of locally thin and fat families (LTFFs) and establish relationships between LTFFs and binary MIPPCs. Accordingly, new lower and upper bounds for binary MIPPCs and LTFFs are derived by means of the probabilistic method and combinatorial techniques. In particular, the order of magnitude for the largest rate of binary MIPPCs is determined. It is shown that the code rate of binary MIPPCs outperforms other existing binary fingerprinting codes (e.g. binary separable codes) as well.

Original language	English
Title of host publication	2023 IEEE International Symposium on Information Theory, ISIT 2023
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2434-2439
Number of pages	6
ISBN (Electronic)	9781665475549
DOIs	https://doi.org/10.1109/ISIT54713.2023.10206524
Publication status	Published - 2023
Event	2023 IEEE International Symposium on Information Theory, ISIT 2023 - Taipei, Taiwan, Province of China Duration: Jun 25 2023 → Jun 30 2023

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2023-June
ISSN (Print)	2157-8095

Conference

Conference	2023 IEEE International Symposium on Information Theory, ISIT 2023
Country/Territory	Taiwan, Province of China
City	Taipei
Period	6/25/23 → 6/30/23

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT54713.2023.10206524

Cite this

Yang, H., Gu, Y., & Zhang, Y. (2023). Bounds for Binary Multimedia Codes with the Identifiable Parent Property. In 2023 IEEE International Symposium on Information Theory, ISIT 2023 (pp. 2434-2439). (IEEE International Symposium on Information Theory - Proceedings; Vol. 2023-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT54713.2023.10206524

Bounds for Binary Multimedia Codes with the Identifiable Parent Property. / Yang, Hongna; Gu, Yujie; Zhang, Yiwei.
2023 IEEE International Symposium on Information Theory, ISIT 2023. Institute of Electrical and Electronics Engineers Inc., 2023. p. 2434-2439 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2023-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Yang, H, Gu, Y & Zhang, Y 2023, Bounds for Binary Multimedia Codes with the Identifiable Parent Property. in 2023 IEEE International Symposium on Information Theory, ISIT 2023. IEEE International Symposium on Information Theory - Proceedings, vol. 2023-June, Institute of Electrical and Electronics Engineers Inc., pp. 2434-2439, 2023 IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, Province of China, 6/25/23. https://doi.org/10.1109/ISIT54713.2023.10206524

@inproceedings{42cdc62cd2b94618a128f85d35ba2213,

title = "Bounds for Binary Multimedia Codes with the Identifiable Parent Property",

abstract = "Multimedia codes with the identifiable parent property (MIPPCs) were proposed to resist collusion attacks for multimedia fingerprinting. However, the largest possible code rate of binary MIPPCs is far from being understood yet. In this paper, we aim to establish lower and upper bounds for the largest code rate of binary MIPPCs. To that end, we introduce a new concept of locally thin and fat families (LTFFs) and establish relationships between LTFFs and binary MIPPCs. Accordingly, new lower and upper bounds for binary MIPPCs and LTFFs are derived by means of the probabilistic method and combinatorial techniques. In particular, the order of magnitude for the largest rate of binary MIPPCs is determined. It is shown that the code rate of binary MIPPCs outperforms other existing binary fingerprinting codes (e.g. binary separable codes) as well.",

author = "Hongna Yang and Yujie Gu and Yiwei Zhang",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 2023 IEEE International Symposium on Information Theory, ISIT 2023 ; Conference date: 25-06-2023 Through 30-06-2023",

year = "2023",

doi = "10.1109/ISIT54713.2023.10206524",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2434--2439",

booktitle = "2023 IEEE International Symposium on Information Theory, ISIT 2023",

address = "United States",

}

TY - GEN

T1 - Bounds for Binary Multimedia Codes with the Identifiable Parent Property

AU - Yang, Hongna

AU - Gu, Yujie

AU - Zhang, Yiwei

PY - 2023

Y1 - 2023

N2 - Multimedia codes with the identifiable parent property (MIPPCs) were proposed to resist collusion attacks for multimedia fingerprinting. However, the largest possible code rate of binary MIPPCs is far from being understood yet. In this paper, we aim to establish lower and upper bounds for the largest code rate of binary MIPPCs. To that end, we introduce a new concept of locally thin and fat families (LTFFs) and establish relationships between LTFFs and binary MIPPCs. Accordingly, new lower and upper bounds for binary MIPPCs and LTFFs are derived by means of the probabilistic method and combinatorial techniques. In particular, the order of magnitude for the largest rate of binary MIPPCs is determined. It is shown that the code rate of binary MIPPCs outperforms other existing binary fingerprinting codes (e.g. binary separable codes) as well.

AB - Multimedia codes with the identifiable parent property (MIPPCs) were proposed to resist collusion attacks for multimedia fingerprinting. However, the largest possible code rate of binary MIPPCs is far from being understood yet. In this paper, we aim to establish lower and upper bounds for the largest code rate of binary MIPPCs. To that end, we introduce a new concept of locally thin and fat families (LTFFs) and establish relationships between LTFFs and binary MIPPCs. Accordingly, new lower and upper bounds for binary MIPPCs and LTFFs are derived by means of the probabilistic method and combinatorial techniques. In particular, the order of magnitude for the largest rate of binary MIPPCs is determined. It is shown that the code rate of binary MIPPCs outperforms other existing binary fingerprinting codes (e.g. binary separable codes) as well.

UR - http://www.scopus.com/inward/record.url?scp=85171434146&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85171434146&partnerID=8YFLogxK

U2 - 10.1109/ISIT54713.2023.10206524

DO - 10.1109/ISIT54713.2023.10206524

M3 - Conference contribution

AN - SCOPUS:85171434146

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2434

EP - 2439

BT - 2023 IEEE International Symposium on Information Theory, ISIT 2023

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2023 IEEE International Symposium on Information Theory, ISIT 2023

Y2 - 25 June 2023 through 30 June 2023

ER -

Bounds for Binary Multimedia Codes with the Identifiable Parent Property

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this