Collusion-secure fingerprinting and B2-sequences

G. Cohen; S. Litsyn; G. Zémor

Collusion-secure fingerprinting and B₂-sequences

G. Cohen^*
, S. Litsyn
, G. Zémor

^*Corresponding author for this work

Ecl. Natl. Sup. des Telecom.

Research output: Contribution to journal › Conference article › peer-review

Abstract

We discuss a strategy initiated by Boneh and Shaw for Collusion-Secure Fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B₂-sequences of binary vectors. A sequence of vectors v₁, v₂,..., v_n is a B₂-sequence if all sums v_i + v_j, 1 ≤ i ≤ j ≤ n, are different : the associated extremal set-theoretic problem is what is the maximal size of a B₂-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.

Original language	English
Pages (from-to)	242
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2000
Externally published	Yes
Event	2000 IEEE International Symposium on Information Theory - Serrento, Italy Duration: 25 Jun 2000 → 30 Jun 2000

Cite this

@article{6031369fdbb54bffbb703dbeb11f9f8b,

title = "Collusion-secure fingerprinting and B2-sequences",

abstract = "We discuss a strategy initiated by Boneh and Shaw for Collusion-Secure Fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B2-sequences of binary vectors. A sequence of vectors v1, v2,..., vn is a B2-sequence if all sums vi + vj, 1 ≤ i ≤ j ≤ n, are different : the associated extremal set-theoretic problem is what is the maximal size of a B2-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.",

author = "G. Cohen and S. Litsyn and G. Z{\'e}mor",

year = "2000",

language = "אנגלית",

pages = "242",

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

issn = "2157-8095",

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

note = "2000 IEEE International Symposium on Information Theory ; Conference date: 25-06-2000 Through 30-06-2000",

}

TY - JOUR

T1 - Collusion-secure fingerprinting and B2-sequences

AU - Cohen, G.

AU - Litsyn, S.

AU - Zémor, G.

PY - 2000

Y1 - 2000

N2 - We discuss a strategy initiated by Boneh and Shaw for Collusion-Secure Fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B2-sequences of binary vectors. A sequence of vectors v1, v2,..., vn is a B2-sequence if all sums vi + vj, 1 ≤ i ≤ j ≤ n, are different : the associated extremal set-theoretic problem is what is the maximal size of a B2-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.

AB - We discuss a strategy initiated by Boneh and Shaw for Collusion-Secure Fingerprinting. We show that under this strategy, finding fingerprinting schemes that resist coalitions of two users amounts to finding B2-sequences of binary vectors. A sequence of vectors v1, v2,..., vn is a B2-sequence if all sums vi + vj, 1 ≤ i ≤ j ≤ n, are different : the associated extremal set-theoretic problem is what is the maximal size of a B2-sequence? We shed new light on this old combinatorial problem and improve on previously known upper bounds.

UR - https://www.scopus.com/pages/publications/0034446898

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0034446898

SN - 2157-8095

SP - 242

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2000 IEEE International Symposium on Information Theory

Y2 - 25 June 2000 through 30 June 2000

ER -

Collusion-secure fingerprinting and B2-sequences

Abstract

Other files and links

Fingerprint

Cite this

Collusion-secure fingerprinting and B₂-sequences