Skip to main content
SpringerLink
Log in

An Empirical Test Suite for Message Authentication Evaluation in Communications Based on Support Vector Machines

  • Conference paper
Artificial Intelligence and Soft Computing - ICAISC 2004 (ICAISC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3070))

Included in the following conference series:

  • 1308 Accesses

Abstract

The strength of data integrity, message authentication and pseudonym generation mechanisms in the design of secure multimedia communication applications relies on the quality of the message digest algorithms used. In this paper, we propose Support Vector Machines based evaluation benchmarks to assess the message digest function quality since there is lack of practical tests to be applied to message digest algorithms in the emerging field of designing secure information and communication systems especially for the delivery of multimedia content, where the issues of copyright protection and security in transactions are outstanding.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Damgard, I.B.: Collision Free Hash Functions and Public Key Signature Schemes. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 203–216. Springer, Heidelberg (1988)

    Google Scholar 

  2. Damgard, I.B.: A Design Principle for Hash Functions’, Advances in Cryptography. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)

    Google Scholar 

  3. Preenel, B.: Cryptographic Hash Functions. Transactions on Telecommunications 5, 431–448 (1994)

    Article  Google Scholar 

  4. Wegman, M.N., Carter, J.L.: New Hash Functions and Their Use in Authentication and Set Quality. J. of Computer and System Sciences 22, 265–279 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Schneier, B.: Applied Cryptography. John Wiley and Sons, Chichester (1996)

    Google Scholar 

  6. Peyravian, M., Roginsky, A., Kshemkalyani, A.: On Probabilities of Hash Value Matches. J. Computers & Security 17(2), 171–176 (1998)

    Article  Google Scholar 

  7. Stinson, D.: Combinatorial Techniques for Universal Hashing. J. of Computer and System Sciences 48, 337–346 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  8. Stallings, W.: Network and Internetwork Security. Prentice Hall, Englewood Cliffs (1995)

    Google Scholar 

  9. Pfleeger, C.P.: Security in Computing. Prentice Hall, Englewood Cliffs (1997)

    Google Scholar 

  10. Simmons, G.J.: Contemporary Cryptology, The Science of Information Integrity. IEEE Press, Los Alamitos (1992)

    MATH  Google Scholar 

  11. FIPS PUB 180-1, Secure Hash Standard (1995)

    Google Scholar 

  12. Dawson, E.P., Gustafson, H.M.: A method for measuring entropy of symmetric cipher key generators. J. of Computers & Security 17(2), 177–184 (1998)

    Article  Google Scholar 

  13. Haykin, S.: Neural Networks. A Comprehensive Foundation. Prentice Hall, Englewood Cliffs (1999)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chalkis Institute of Technology & Hellenic Open Univ., Rodu 2, Ano Iliupolis, Athens, 16342, Greece

    D. A. Karras

Authors
  1. D. A. Karras
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. German Research Center of Artificial Intelligence (DFKI), Germany

    Jörg H. Siekmann

  3. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  4. Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, Initiative in Soft Computing (BISC), 94720-1776, Berkeley, CA

    Lotfi A. Zadeh

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karras, D.A. (2004). An Empirical Test Suite for Message Authentication Evaluation in Communications Based on Support Vector Machines. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds) Artificial Intelligence and Soft Computing - ICAISC 2004. ICAISC 2004. Lecture Notes in Computer Science(), vol 3070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24844-6_94

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24844-6_94

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22123-4

  • Online ISBN: 978-3-540-24844-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation