Total views : 163

Consequence of Space Efficient Secret Sharing for Secure Multi-Path Data Delivery in WSN

Affiliations

  • Department of Computer Science, Bharathiar University, Coimbatore – 641046, Tamil Nadu, India
  • Department of Computer Science, Arignar Anna Govt. Arts College, Namakkal – 637002, Tamil Nadu, India

Abstract


Objective: Byzantine Attacks are more challenging to protect against and it may stop Transmitting and cheating with malicious data in Wireless Sensor Networks (WSN). The Primary objective is to give a solution to enhance the security in terms of Byzantine attacks. Methods/Analysis: In this paper, Space Efficient Secret Sharing (SESS) scheme is proposed for secured data delivery in the WSN. The SESS scheme primarily uses recursive polynomial interpolation and its secret size is optimized as kzz-1. Besides, this paper incorporates the Prufer Sequence and 3-node disjoint shortest Multipath Routing for optimizing the number of paths between the source and the destination. Findings: The implementation is mainly concern towards the effectiveness of SESS scheme over RS-coding scheme. Since, RS-coding scheme has more computation than the proposed. The key finding reveals that the proposed SESS scheme is outperformed in many instances. Conclusion: The simulation results depict the various performance metrics of WSN in terms of the quality of service. Among the list of metrics, the proposed SESS scheme is outperformed in optimizing the control packet overhead. It improves the average network lifetime, since it is consuming less energy.

Keywords

Multi-Path Source Routing Scheme, Prufer Sequence, Space Efficient Secret Sharing (SESS), Wireless Sensor Network (WSN).

Full Text:

 |  (PDF views: 127)

References


  • Bhandari R. Survivable networks - algorithms for diverse routing. Kluwer Academic Publishers; 1999.
  • Huang D. Secure multi-path data deliver in sensor networks. In Institute of Electrical and Electronics Engineers (IEEE) Military Communications Conference (MILCOM); 2009 Oct 18–21. p. 1–7. Crossref
  • Krawczyk. H. Secret sharing made short. In the Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, Lecture notes. 1993; 773:136– 46. Crossref
  • Lamport L, Shostak R, Pease M. The byzantine general’s problem. Association for Computing Machinery (ACM) Transactions on Programming Languages and Systems. 1982 Jul; 4(3):382–401. Crossref
  • McEliece RJ, Sarwate DV. On sharing secrets and ReedSolomon codes. Communications of the Association for Computing Machinery (ACM). 1981 Sep; 24(9):583–4. Crossref
  • Parakh A, Kak S. Space efficient secret sharing for implicit data security. Information Sciences. 2011 Jan 15; 181(2):335–41. Crossref
  • Rogaway P, Bellare M. Robust computational secret sharing and a unified account of classical secret-sharing goals. In the Proceedings of the 14th Association for Computing Machinery (ACM) Conference on Computer and Communications Security (CCS), Alexandria, Virginia, USA; 2007. p. 172–84. Crossref
  • Prüfer H. Neuer beweis eines satzes über permutationen. Architecture, Mathematical Physics. 1918; 27:742–4.
  • Reed S, Solomon G. Polynomial codes over certain finite fields. SIAM Journal of Applied Mathematics. 1960; 8:300– 4.
  • Shamir, A. How to share a secret. Communications of the Association for Computing Machinery (ACM). 1979 Nov; 22(11):612–3. Crossref

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.