Skip to main content
SpringerLink
Log in

Practical Scenarios for the Van Trung-Martirosyan Codes

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3481))

Included in the following conference series:

  • 1252 Accesses

Abstract

Traitor tracing schemes are used in to detect piracy in broadcast encryption systems, in case that a bounded number of authorized users are dishonest. In this paper we present, by solving a variant of the guessing secrets problem defined by Chung, Graham and Leighton [3], a traitor tracing scheme based in the recently discovered van Trung-Martirosyan traceability codes.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Guruswami, V., Kaufman, T., Sudan, M.: Guessing secrets efficiently via list decoding. in: ACM, SODA 2002, 254–262 (2002)

    Google Scholar 

  2. Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 480–491. Springer, Heidelberg (1994)

    Google Scholar 

  3. Chung, F., Graham, R., Leighton, T.: Guessing secrets. The Electronic Journal of Combinatorics 8(1) (2001)

    Google Scholar 

  4. Fiat, A., Naor, M.: Broadcast encryption. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, p. 175. Springer, Heidelberg (1994)

    Google Scholar 

  5. Fiat, A., Tassa, T.: Dynamic traitor tracing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 354–371. Springer, Heidelberg (1999)

    Google Scholar 

  6. I’ve got a secret. A classic 50’s and 60’s television gameshow. See, http://www.timvp.com/ivegotse.html

  7. Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraicgeometry codes. IEEE Trans. Inform. Theory 45(6), 1757–1767 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Safavi-Naini, R., Wang, Y.: Sequential traitor tracing. IEEE Trans. Inform. Theory 49(5), 1319–1326 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Silverberg, A., Staddon, J., Walker, J.: Efficient traitor tracing algorithms using list decoding. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, p. 175. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Staddon, J.N., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inform. Theory 47(3), 1042–1049 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Trung, T.V., Martirosyan, S.: New constructions for ipp codes. In: Proc. IEEE International Symposium on Information Theory, ISIT 2003, p. 255 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Telematics Engineering, Universitat Politècnica de Catalunya, C/ Jordi Girona 1 i 3, Campus Nord, Mod C3, UPC, 08034, Barcelona, Spain

    Marcel Fernandez, Miguel Soriano & Josep Cotrina

Authors
  1. Marcel Fernandez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel Soriano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Josep Cotrina
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, P.O. Box, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, P.O. Box, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fernandez, M., Soriano, M., Cotrina, J. (2005). Practical Scenarios for the Van Trung-Martirosyan Codes. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424826_66

Download citation

  • DOI: https://doi.org/10.1007/11424826_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25861-2

  • Online ISBN: 978-3-540-32044-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation