Secure Information Recovery for Decentralized Interruption Tolerant Defense Data Network

Main Article Content

Korra Bichya

Abstract

Portable nodes in military environments, for example, a front line or an antagonistic area are prone to experience the undergo of irregular system network and frequent partitions. Interruption tolerant network (ITN) innovations are getting to be fruitful results that permit remote device conveyed by officers to speak with one another and access the secret data or summon dependably by abusing outside capacity nodes. Probably the most difficult issues in this situation are the requirement of approval arrangements and the
strategies redesign for secure information recovery. Ciphertext-policy attribute-based encryption (CP-ABE) is a guaranteeing cryptographic answer for the right to gain entrance control issues. In any case, the issue of applying CP-ABE in decentralized DTNs presents a few securities and protection challenges as to the property disavowal, key escrow, and coordination of characteristics issued from distinctive powers. In this paper, we propose a safe information recovery plan utilizing CP-ABE for decentralized DTNs where numerous key powers deal with their qualities autonomously. We show how to apply the proposed mechanism to safely and proficiently deal with the classified information dispersed in the. Interruption tolerant network (ITN)

Article Details

How to Cite
[1]
B. Korra, “Secure Information Recovery for Decentralized Interruption Tolerant Defense Data Network”, Int. J. Comput. Eng. Res. Trends, vol. 1, no. 3, pp. 119–126, Sep. 2014.
Section
Research Articles
Author Biography

Korra Bichya

 

 

References

. Junbeom Hur and Kyungtae Kang, Member, IEEE, ACM “Secure Data Retrieval for Decentralized Disruption-Tolerant Military

Networks”-IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 22, NO. 1, FEBRUARY 2014.

. S. Rafaeli and D. Hutchison, “A survey of key management for secure group communication,” Comput. Surv., vol. 35, no. 3, pp. 309–

,2003.

S. Mittra, “Iolus: A framework for scalable secure multicasting,” in Proc. ACM SIGCOMM, 1997, pp. 277–288.

P. Golle, J. Staddon, M. Gagne, and P. Rasmussen, “A content-driven access control system,” in Proc. Symp. Identity Trust Internet, 2008,pp.

–35.

L. Cheung and C. Newport, “Provably secure ciphertext policy ABE,”in Proc. ACM Conf. Comput. Commun. Security, 2007, pp. 456–

V. Goyal, A. Jain, O. Pandey, and A. Sahai, “Bounded ciphertext policy attribute-based encryption,” in Proc. ICALP, 2008, pp. 579–591.

X. Liang, Z. Cao, H. Lin, and D. Xing, “Provably secure and efficient bounded ciphertext policy attribute based encryption,” in Proc. ASI

ACCS, 2009, pp. 343–352.

S. S. M. Chow, “Removing escrow from identity-based encryption,” in Proc. PKC, 2009, LNCS 5443, pp. 256–276.

C. K. Wong, M. Gouda, and S. S. Lam, “Secure group communications using key graphs,” in Proc. ACM SIGCOMM, 1998, pp.

–79.

M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu,“Plutus: Scalable secure file sharing on untrusted storage,” in

Proc.Conf. File Storage Technol., 2003, pp. 29–42