Privacy Preserving of Data Sharing for Cooperative Network with Untrusted Relay Nodes

Privacy Preserving of Data Sharing for Cooperative Network with Untrusted Relay Nodes

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2015 by IJETT Journal
Volume-30 Number-6
Year of Publication : 2015
Authors : Deepthi Mai Karanam, Behara Vineela

Citation 

Deepthi Mai Karanam, Behara Vineela"Privacy Preserving of Data Sharing for Cooperative Network with Untrusted Relay Nodes", International Journal of Engineering Trends and Technology (IJETT), V30(6),306-309 December 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
one of the fundamental goals of network is to provide security of sharing information. Before sharing the information in network each node will be identified by server for the authentication. By providing authentication process we can identify the nodes trusted or untrusted. If the node is trusted node it will share information through the network. But the node is untrusted node it will jamming transferred message. By performing authentication process we can generate signature of each node in the network. By verifying the signature it will conform the given node is trusted node or untrusted node. In this paper we are proposed mainly two concepts for authentication of nodes in network and privacy of transferring message. In this paper we are using prime order signature algorithm for the generation of signature and bit level key xor algorithm for encryption, decryption of transferring message. By implementing the prime order signature algorithm we can find out node is trusted node or untrusted node in a network. By using bit level key xor algorithm we can convert transferring message into unknown format and again get convert unknown format data into plain format. By implementing those techniques we can provide more efficiency and more privacy of transferring message.

 References

[1] Y. Liang and H. V. Poor, “Multiple-access channels with confidential messages,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 976–1002, 2008.
[2] E. Tekin, S. Serbetli, and A. Yener, “On secure signaling for the Gaussian multiple access wire-tap channel,” in Proceedings of the 39th Asilomar Conference on Signals, Systems and Computers (ACSSC ’05), pp. 1747–1751, Pacific Grove, Calif, USA, October-November 2005.
[3] E. Tekin and A. Yener, “The Gaussian multiple access wire-tap channel,” IEEE Transactions on Information Theory, vol. 54, no. 12, pp. 5747–5755, 2008.
[4] E. Tekin and A. Yener, “The general Gaussian multipleaccess and two-way wiretap channels: achievable rates and cooperative jamming,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2735–2751, 2008.
[5] Y. Oohama, “Relay channels with confidential messages,” submitted to IEEE Transactions on Information Theory http://arxiv.org/abs/cs/0611125.
[6] L. Lai and H. El Gamal, “The relay-eavesdropper channel: cooperation for secrecy,” IEEE Transactions on Information Theory, vol. 54, no. 9, pp. 4005–4019, 2008.
[7] X. He and A. Yener, “Cooperation with an untrusted relay: a secrecy perspective,” 2008, submitted to IEEE Transactions on Information Theory http://arxiv.org/abs/0910.1511.
[8] R. Liu, I. Maric, P. Spasojevic, and R. D. Yates, “Discrete memoryless interference and broadcast channels with confi- dential messages: secrecy rate regions,” IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2493–2507, 2008.
[9] R. Liu and H. V. Poor, “Multi-antenna Gaussian broadcast channels with confidential messages,” in Proceedings of IEEE International Symposium on Information Theory (ISIT ’08), pp. 2202–2206, Toronto, Canada, July 2008. (2002) The IEEE website. [Online]. Available: http://www.ieee.org/
[10] X. He and A. Yener, “On the equivocation region of relay channels with orthogonal components,” in Proceedings of the 41st Asilomar Conference on Signals, Systems and Computers (ACSSC ’07), pp. 883–887, Pacific Grove, Calif, USA, November 2007.
[11] X. He and A. Yener, “The role of an untrusted relay in secret communication,” in Proceedings of IEEE International Symposium on Information Theory (ISIT ’08), pp. 2212–2216, Toronto, Canada, July 2008.
[12] E. Ekrem and S. Ulukus, “Secrecy in cooperative relay broadcast channels,” in Proceedings of IEEE International Symposium on Information Theory (ISIT ’08), pp. 2217– 2221, Toronto, Canada, July 2008.
[13] E. Ekrem and S. Ulukus, “Secrecy in cooperative relay broadcast channels,” 2008, submitted to IEEE Transactions on Information Theory http://www.ece.umd.edu/ ulukus/ papers/journal/crbc-secrecy.pdf.
[14] T. M. Cover and A. A. El Gamal, “Capacity theorems for the relay channel,” IEEE Transactions on Information Theory, vol. 25, no. 5, pp. 572–584, 1979.
[15]. X. He and A. Yener, “Cooperation with an untrusted relay: A secrecy perspective,” IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3807–3827, Aug. 2010.
[16].C. Jeong, I.-M. Kim, and D. I. Kim, “Joint secure beamforming designvat the source and the relay for an amplify-and-forward MIMO untrusted relay system,” IEEE Trans. Signal Process., vol. 60, no. 1, pp. 310–325, Jan. 2012.
[17] J. Huang, A. Mukherjee, and A. L. Swindlehurst, “Secure communication via an untrusted non-regenrative relay in fading channels,” IEEE Trans. Signal Process., vol. 61, no. 10, pp. 2536–2550, May 2013.
[18] L. Wang, M. Elkashlan, J. Huang, N. H. Tran, and T. Q. Duong, “Secure transmission with optimal power allocation in untrusted relay networks,” IEEE Wireless Commun. Lett., vol. 3, no. 3, pp. 289–292, Jun. 2014.
[19] L. Sun, T. Zhang, Y. Li, and H. Niu, “Performance study of two-hop amplify-and-forward systems with untrustworthy relay nodes,” IEEE Trans. Veh. Technol., vol. 61, no. 8, pp. 3801–3807, Oct. 2012.
[20] H. Khodakarami and F. Lahouti, “Link adaptation with untrusted relay assignment: Design and performance analysis,” IEEE Trans. Commun., vol. 61, no. 12, pp. 4874–4883, Dec. 2013.

Keywords
Security, Cryptography, Jamming, Signature, secret key.