Energy-Efficient and Non-interactive Self-certification in MANETs

  • Jeong Hyun Yi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4280)

Abstract

Mobile ad hoc networks (MANETs) have many well-known applications in military settings as well as in emergency and rescue operations. However, lack of infrastructure and lack of centralized control make MANETs inherently insecure, and therefore specialized security services are needed for their deployment. Self-certification is an essential and fundamental security service in MANETs. It is needed to securely cope with dynamic membership and topology and to bootstrap other important security primitives and services without the assistance of any centralized trusted authority. An ideal protocol must involve minimal interaction among the MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of weak or resource-limited devices, self-certification protocol must be efficient in terms of computation and communication. Unfortunately, previously proposed protocols are far from being ideal.

In this paper, we propose fully non-interactive self-certification protocol based on bi-variate polynomial secret sharing and threshold BLS signature techniques. In contrast with prior work, our techniques do not require any interaction and do not involve any costly reliable broadcast communication among MANET nodes. We thoroughly analyze our proposal and show that it compares favorably to previous mechanisms.

Keywords

Optimize Link State Route Partial Share Tate Pairing Partial Membership Reliable Broadcast 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barr, K., Asanovic, K.: Energy Aware Lossless Data Compression. In: ACM International Conference on Mobile Systems, Applications, and Services, pp. 231–244 (2003)Google Scholar
  2. 2.
    Kong, J., Zerfos, P., Luo, H., Lu, S., Zhang, L.: Providing Robust and Ubiquitous Security Support for MANET. In: IEEE International Conference on Network Protocols, pp. 251–260 (2001)Google Scholar
  3. 3.
    Kong, J., Luo, H., Xu, K., Gu, D.L., Gerla, M., Lu, S.: Adaptive Security for Multi-level Ad-hoc Networks. Wiley Journal of Wireless Communications and Mobile Computing 2, 533–547 (2002)CrossRefGoogle Scholar
  4. 4.
    Luo, H., Zerfos, P., Kong, J., Lu, S., Zhang, L.: Self-securing Ad Hoc Wireless Networks. In: IEEE Symposium on Computers and Communications, pp. 567–574 (2002)Google Scholar
  5. 5.
    Narasimha, M., Tsudik, G., Yi, J.H.: On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control. In: IEEE International Conference on Network Protocols, pp. 336–345 (2003)Google Scholar
  6. 6.
    Saxena, N., Tsudik, G., Yi, J.H.: Admission Control in Peer-to-Peer: Design and Performance Evaluation. In: ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 104–114 (2003)Google Scholar
  7. 7.
    Saxena, N., Tsudik, G., Yi, J.H.: Identity-Based Access Control for Ad Hoc Groups. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 362–379. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Luo, H., Kong, J., Zerfos, P., Lu, S., Zhang, L.: URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks. IEEE/ACM Transactions on Networking 12, 1049–1063 (2004)CrossRefGoogle Scholar
  9. 9.
    Jarecki, S., Saxena, N., Yi, J.H.: An Attack on the Proactive RSA Signature Scheme in the URSA Ad Hoc Network Access Control Protocol. In: ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 1–9 (2004)Google Scholar
  10. 10.
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 354–371. Springer, Heidelberg (1996)Google Scholar
  11. 11.
    Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Boldyreva, A.: Efficient Threshold Signatures, Multisignatures and Blind Signatures based on the Gap-Diffie-Hellman-Group Signature Scheme. In: PKC 2003. LNCS, vol. 2567, pp. 31–46 (2003)Google Scholar
  13. 13.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: ACM Symposium on the Theory of Computing, pp. 1–10 (1988)Google Scholar
  14. 14.
    Naor, M., Pinkas, B., Reingold, O.: Distributed Pseudo-random Functions and KDCs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 327–346. Springer, Heidelberg (1999)Google Scholar
  15. 15.
    Blundo, C., Santis, A.D., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)Google Scholar
  16. 16.
    Liu, D., Ning, P.: Establishing Pairwise Keys in Distributed Sensor Networks. In: ACM Conference on Computers and Communication Security, pp. 52–61 (2003)Google Scholar
  17. 17.
    Saxena, N., Tsudik, G., Yi, J.H.: Efficient Node Admission for Short-lived Mobile Ad Hoc Networks. In: IEEE International Conference on Network Protocols, pp. 269–278 (2005)Google Scholar
  18. 18.
    Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  19. 19.
    Kim, Y., Mazzocchi, D., Tsudik, G.: Admission Control in Peer Groups. In: IEEE International Symposium on Network Computing and Applications, pp. 131–139 (2003)Google Scholar
  20. 20.
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 295–310. Springer, Heidelberg (1999)Google Scholar
  21. 21.
    Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  22. 22.
    Frey, G., Müller, M., Rück, H.G.: The Tate Pairing and the Discrete Logarithm Applied to Elliptic Curve Cryptosystems. IEEE Transactions on Information Theory 45, 1717–1719 (1999)MATHCrossRefGoogle Scholar
  23. 23.
    Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)MATHGoogle Scholar
  24. 24.
    Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive Secret Sharing, Or How To Cope With Perpetual Leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)Google Scholar
  25. 25.
    Bracha, G.: An Asynchronous [(n-1)/3]-resilient Consensus Protocol. In: ACM Symposium on Priniciples of Distributed Computing, pp. 154–162 (1984)Google Scholar
  26. 26.
    Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1992)Google Scholar
  27. 27.
    OpenSSL Project: http://www.openssl.org
  28. 28.
    MIRACL Library: http://indigo.ie/~mscott
  29. 29.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jeong Hyun Yi
    • 1
  1. 1.Networking Technology LabSamsung Advanced Institute of Technology 

Personalised recommendations