Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 2001: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 260–267Cite as

Partially Identifying Codes for Copyright Protection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

Abstract

If Ä i s aq-ary code of length n and a, b, ..., e are codewords, then c is called a descendant of a, b, ..., e if c i ε a i , b i , ..., e i for i = 1, ..., n. Codes Ä with the property that coalitions of a limited size have restrictions on their descendants are studied. Namely, we consider codes with the following partial identification property, referred to later as 2- secure frameproof codes (2-SFPC): any two non intersecting coalitions of size at most 2 have no common descendant.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Th. Beth, D. Jungnickel and H. Lenz, Design Theory, Wissenschaftsverlag, Berlin, (1985).

    Google Scholar 

  2. D. Boneh and J. Shaw, “Collusion-secure fingerprinting for digital data”, Springer-Verlag LNCS963 (1995), pp. 452–465 (Advances in Cryptology-Crypto’ 95).

    Google Scholar 

  3. B. Chor, A. Fiat and M. Naor, “Tracing traitors”, Springer-Verlag LNCS839 (1994), pp. 257–270(Advances in Cryptology-Crypto’ 94).

    Google Scholar 

  4. A. D. Friedman, R. L. Graham and J. D. Ullman, “Universal single transition time asynchronous state assignments”, IEEE Trans. Comput. vol.18 (1969) pp.541–547.

    Article  Google Scholar 

  5. J. Körner and G. Simonyi, “Separating partition systems and locally different sequences”, SIAM J. Discrete Math., vol. 1, pp. 355–359, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, (1977).

    Google Scholar 

  7. T. Nanya and Y. Tohma, “On Universal Single Transition Time Asynchronous State Assignments”, IEEE Trans. Comput. vol. 27 (1978) pp. 781–782.

    Article  MATH  Google Scholar 

  8. Q.A. Nguyen, L. Györ. and J. Massey, “Constructions of Binary Constant-Weight Cyclic Codes and Cyclically Permutable Codes”, IEEE Trans. on Inf. Theory, vol. 38, no. 3, (1992), pp. 940–949.

    Article  MATH  Google Scholar 

  9. V.S. Pless, W.C. Huffman-Editors, Handbook of Coding Theory, Elsevier, Amsterdam (1998).

    Google Scholar 

  10. Yu.L. Sagalovitch, “Separating systems”, Problems of Information Transmission, Vol. 30 (2) (1994), pp. 105–123.

    MathSciNet  Google Scholar 

  11. D.R. Stinson, Tran Van Trung and R. Wei, “Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures”, J. Stat. Planning and Inference, vol. 86 (2)(2000), pp. 595–617.

    Article  MATH  Google Scholar 

  12. D.R. Stinson, R. Wei and L. Zhu, “New Constructions for Perfect Hash Families and Related Structures Using Combinatorial Designs and Codes”, J. of Combinatorial Designs, vol. 8 (2000), pp. 189–200.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HSH, Bjørnsonsg. 45, 5528, Haugesund, Norway

    Sylvia Encheva

  2. ENST, 46 rue Barrault, 75634, Paris Cedex 13, France

    Gérard Cohen

Authors
  1. Sylvia Encheva
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gérard Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, RMIT University, GPO Box 2476V, 3001, Melbourne, Australia

    Serdar Boztaş

  2. Department of Computing, Macquarie University, 2109, NSW, Australia

    Igor E. Shparlinski

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Encheva, S., Cohen, G. (2001). Partially Identifying Codes for Copyright Protection. In: Boztaş, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation