• DocumentCode
    2388410
  • Title

    Collusion-secure fingerprinting and B2-sequences

  • Author

    Cohen, Gérard ; Litsyn, Simon ; Zémor, Gilles

  • Author_Institution
    Ecole Nationale Superieure des Telecommun., Paris, France
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    242
  • Abstract
    We discuss a strategy initiated by Boneh and Shaw (see IEEE Trans. Inform. Theory, vol.44, p.1897-1905, 1998) 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
  • Keywords
    binary sequences; combinatorial mathematics; cryptography; set theory; vectors; B2-sequences; associated extremal set-theoretic problem; binary vectors; collusion-secure fingerprinting; combinatorial problem; upper bounds; Fingerprint recognition; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2000. Proceedings. IEEE International Symposium on
  • Conference_Location
    Sorrento
  • Print_ISBN
    0-7803-5857-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2000.866540
  • Filename
    866540
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2388410