Accusation Resolution Using Security Metrology

  • Scott C. -H. Huang
  • Shamila Makki
  • Niki Pissinou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4138)


In this paper, we design good security metrology to solve the problem when, in a network, there is a node accusing another one of misbehaving. This problem is not easy because bad nodes tend to use false accusations to disrupt the network and the result is disastrous. We set up a standard, namely the security ratings, and use it to resolve such accusations. We use approaches of negative-credit, and mixed-credit (positive-credit), respectively, to solve this problem. We exclude the use of public key infrastructure and use only symmetric ciphers and hash functions to reduce the computational overhead of the security metrology. Our results prove to be practical and robust against node compromise. The communication and computational overhead also prove to be small and suitable for real world applications.


Malicious Node Computational Overhead Message Authentication Code Good Node Hash Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    U.S. National Institute of Standards and Technology. Federal information processing standards publication 140-1: Security requirements for cryptographic modules (January 1994)Google Scholar
  2. 2.
    U.S. National Institute of Standards and Technology. Common criteria for information technology security evaluation, version 2.1 (1999)Google Scholar
  3. 3.
    Anderson, R., Kuhn, M.: Tamper Resistance - a Cautionary Note. In: Proceedings of the Second USENIX Workshop on Electronic Commerce, November 1996, pp. 1–11 (1996)Google Scholar
  4. 4.
    Dierks, T., Allen, C.: The TLS protocol, version 1.0 (1998),
  5. 5.
    Freeman, W., Miller, E.: An experimental analysis of cryptographic overhead in performance-critical systems. In: The 7th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 1999), College Park, MD, October 1999, pp. 348–357 (1999)Google Scholar
  6. 6.
    Gutmann, P.: Secure deletion of data from magnetic and solid-state memory. In: 6th USENIX Security Symposium Proceedings, San José, California, July 1996, pp. 77–89 (1996)Google Scholar
  7. 7.
    Halevy, D., Shamir, A.: The LSD Broadcast Encryption Scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Huang, S.C.-H., Makki, S., Pissinou, N.: On optimizing compatible security policies in wireless networks. EURASIP Journal on Wireless Communications and NetworkingGoogle Scholar
  9. 9.
    Naor, D., Naor, M., Lotspiech, J.: Revocation and Tracing Schemes for Stateless Receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.D.: SPINS: Security protocols for sensor networks. Wireless Networks 8(5), 521–534 (2002)CrossRefzbMATHGoogle Scholar
  11. 11.
    Sherman, A.T., McGrew, D.A.: Key establishment in large dynamic groups using one-way function trees. IEEE Transactions on Software Engineering 29(05), 444–458 (2003)CrossRefGoogle Scholar
  12. 12.
    U.S. Department of Defense, Computer Security Center. Trusted computer system evaluation criteria (December 1985)Google Scholar
  13. 13.
    Wong, C.K., Gouda, M.G., Lam, S.S.: Secure group communications using key graphs. IEEE/ACM Transactions on Networking 8(1), 16–30 (2000)CrossRefGoogle Scholar
  14. 14.
    Yee, B.S.: Security metrology and the monty hall problem (2001),
  15. 15.
    Zhu, S., Setia, S., Jajodia, S.: LEAP: Efficient security mechanisms for large-scale distributed sensor networks. In: ACM CCS 2003 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Scott C. -H. Huang
    • 1
    • 2
  • Shamila Makki
    • 2
  • Niki Pissinou
    • 2
  1. 1.City University of Hong Kong 
  2. 2.Florida International University 

Personalised recommendations