Frameproof codes and compressive sensing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Fingerprinting of digital content is often employed to prevent a small coalition of legitimate users from constructing a copy whose fingerprint is registered to a user not in the coalition. Sets of fingerprints that prevent t or fewer users from framing another user in this way are frameproof codes. A frameproof code is termed secure when no fingerprint constructed by a coalition of t or fewer users can also be constructed by a disjoint coalition of t or fewer users. Secure frameproof codes are related to cover-free families arising in combinatorial group testing. Here a different connection is explored. Interpreting frameproof codes and secure frameproof codes as certain types of separating hash families, it is shown that each underlies a useful measurement matrix for compressive sensing. Indeed frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ0-recoverability of t-sparse vectors, while secure frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ1-recoverability of t-sparse vectors. Consequences for the construction of measurement matrices are briefly outlined, but the focus is on the combinatorial similarities of frameproof codes, separating and distributing hash families, and measurement matrices.

Original languageEnglish (US)
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages985-990
Number of pages6
DOIs
StatePublished - 2010
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: Sep 29 2010Oct 1 2010

Other

Other48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
CountryUnited States
CityMonticello, IL
Period9/29/1010/1/10

Fingerprint

Testing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Colbourn, C., Horsley, D., & Syrotiuk, V. (2010). Frameproof codes and compressive sensing. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 (pp. 985-990). [5707016] https://doi.org/10.1109/ALLERTON.2010.5707016

Frameproof codes and compressive sensing. / Colbourn, Charles; Horsley, Daniel; Syrotiuk, Violet.

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 985-990 5707016.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Colbourn, C, Horsley, D & Syrotiuk, V 2010, Frameproof codes and compressive sensing. in 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010., 5707016, pp. 985-990, 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, Monticello, IL, United States, 9/29/10. https://doi.org/10.1109/ALLERTON.2010.5707016
Colbourn C, Horsley D, Syrotiuk V. Frameproof codes and compressive sensing. In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. p. 985-990. 5707016 https://doi.org/10.1109/ALLERTON.2010.5707016
Colbourn, Charles ; Horsley, Daniel ; Syrotiuk, Violet. / Frameproof codes and compressive sensing. 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010. 2010. pp. 985-990
@inproceedings{b216681fa7b5422ea688a319a7c165dc,
title = "Frameproof codes and compressive sensing",
abstract = "Fingerprinting of digital content is often employed to prevent a small coalition of legitimate users from constructing a copy whose fingerprint is registered to a user not in the coalition. Sets of fingerprints that prevent t or fewer users from framing another user in this way are frameproof codes. A frameproof code is termed secure when no fingerprint constructed by a coalition of t or fewer users can also be constructed by a disjoint coalition of t or fewer users. Secure frameproof codes are related to cover-free families arising in combinatorial group testing. Here a different connection is explored. Interpreting frameproof codes and secure frameproof codes as certain types of separating hash families, it is shown that each underlies a useful measurement matrix for compressive sensing. Indeed frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ0-recoverability of t-sparse vectors, while secure frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ1-recoverability of t-sparse vectors. Consequences for the construction of measurement matrices are briefly outlined, but the focus is on the combinatorial similarities of frameproof codes, separating and distributing hash families, and measurement matrices.",
author = "Charles Colbourn and Daniel Horsley and Violet Syrotiuk",
year = "2010",
doi = "10.1109/ALLERTON.2010.5707016",
language = "English (US)",
isbn = "9781424482146",
pages = "985--990",
booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",

}

TY - GEN

T1 - Frameproof codes and compressive sensing

AU - Colbourn, Charles

AU - Horsley, Daniel

AU - Syrotiuk, Violet

PY - 2010

Y1 - 2010

N2 - Fingerprinting of digital content is often employed to prevent a small coalition of legitimate users from constructing a copy whose fingerprint is registered to a user not in the coalition. Sets of fingerprints that prevent t or fewer users from framing another user in this way are frameproof codes. A frameproof code is termed secure when no fingerprint constructed by a coalition of t or fewer users can also be constructed by a disjoint coalition of t or fewer users. Secure frameproof codes are related to cover-free families arising in combinatorial group testing. Here a different connection is explored. Interpreting frameproof codes and secure frameproof codes as certain types of separating hash families, it is shown that each underlies a useful measurement matrix for compressive sensing. Indeed frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ0-recoverability of t-sparse vectors, while secure frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ1-recoverability of t-sparse vectors. Consequences for the construction of measurement matrices are briefly outlined, but the focus is on the combinatorial similarities of frameproof codes, separating and distributing hash families, and measurement matrices.

AB - Fingerprinting of digital content is often employed to prevent a small coalition of legitimate users from constructing a copy whose fingerprint is registered to a user not in the coalition. Sets of fingerprints that prevent t or fewer users from framing another user in this way are frameproof codes. A frameproof code is termed secure when no fingerprint constructed by a coalition of t or fewer users can also be constructed by a disjoint coalition of t or fewer users. Secure frameproof codes are related to cover-free families arising in combinatorial group testing. Here a different connection is explored. Interpreting frameproof codes and secure frameproof codes as certain types of separating hash families, it is shown that each underlies a useful measurement matrix for compressive sensing. Indeed frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ0-recoverability of t-sparse vectors, while secure frameproof codes for coalitions of t users underlie measurement matrices that admit ℓ1-recoverability of t-sparse vectors. Consequences for the construction of measurement matrices are briefly outlined, but the focus is on the combinatorial similarities of frameproof codes, separating and distributing hash families, and measurement matrices.

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

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

U2 - 10.1109/ALLERTON.2010.5707016

DO - 10.1109/ALLERTON.2010.5707016

M3 - Conference contribution

AN - SCOPUS:79952436420

SN - 9781424482146

SP - 985

EP - 990

BT - 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

ER -