iosr-JCE   Volume-13 ~ Issue-5

Abstract: In the present scenario, any communication of internet and networks application requires security.Lots of data security and data hiding algorithms have been developed in the last decade.Cryptography and steganography are the two major techniques for secret communication.In this paper,the secret image is first encrypted by using BLOWFISH algorithm which has very good performance and is a most powerful technique compared to other Algorithms. Now this encrypted imageis embedded with videoby using LSB Approach of steganography. Our proposed model gives two layers of security for secret data, which fully satisfy the basic key factors of information security system that includes: Confidentiality, Authenticity, Integrity and Non – Repudiation.

Keywords: Cryptography, Steganography, Encryption,BlowfishAlgorithm,LSB.

[1]. Satinsown,D."Cryptography:Theory and practice"
[2]. RatinderKaur,V.K.Banga "Image Security using Encryption based Algorithm" International Conference on Trends in Electrical,Electronics and Power Engineering(ICTEEP 2012)July 15-16,2012 Singapore.
[3]. Zaidoon kh.AL-Ani, A.A.Zaidan, B.B.Zaidan and Hamdan.O.Alanazi "Overview: Main Fundamentals for Steganography" Journal of computing,Volume 2,Issue 3,March 2010 ISSN 2151-9617
[4]. Advanced Steganography Algorithm using encrypted secret message,JoyshreeNath and AsokeNath,InternationalJournalof Advanced Computer Science and Application(IJACSA) Vol-2 No.3,Page 19-24 ,March 2011
[5]. JawaharThakur,Nagesh Kumar, "DES, AES and Blowfish: symmetric key cryptography algorithms simulation based performance analysis",in International Journal of Emerging Technology and Advanced Engineering Volume1,Issue 2,December 2011.
[6]. B.Schneier,Description of a new Variable-Length Key,64-bit Block Cipher(Blowfish)Fast Software Encryption,Cambridge Security Workshop Proceedings(December 1993),Springer-Verlag,1994,pp.191-204.
[7]. Rafael C Gonzalez,Richard E. Woods "Digital Image Processing "Book Second Edition,Pearson Education.
[8]. Prof. DP Gaikwad, TruptiJagdale ,Swati Dhanokar, AbhijeetMoghe, AkashPathak"Hiding the Text and Image Message of Variable Size Using Encryption and Compression Algorithm in VedioSteganography"International Journal of Engineering Research and Application(IJERA) Volume 1,Issue2, pp.102-108
[9]. MrithaRamalingam, "Stego Machine – Video Steganography using Modified LSB Algorithm" ,World Academy of Science, Engineering and Technology 50 2011

Abstract: MOBILE ad hoc networks (MANETs) have attracted a lot of attention due to the popularity of mobile devices and the advances in wireless communication technologies. A MANET is a peer-to-peer multi hop mobile wireless network that has neither a fixed infrastructure nor a central server. Each node in a MANET acts as a router, and communicates with each other. In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes may selfishly decide only to cooperate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation. In particular, we develop a selfish node detection algorithm that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

Index Terms: Mobile ad hoc networks, selfish nodes, router, replica allocation.

[1]. Jae-Ho Choi, Kyu-Sun Shim, "Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network" SangKeun Lee, and Kun-Lung Wu, Fellow, IEEE.2012.
[2]. L. Anderegg, S. Eidenbenz, "Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents", in: Proceedings of ACM MobiCom, 2003, pp. 245–259.
[3]. J. Broch, D.A. Maltz, D.B. Johnson, Y. Chun Hu, J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols", in: Proceedings of ACM MobiCom, 1998, pp. 85–97.
[4]. G. Cao, L. Yin, C.R. Das, "Cooperative cache-based data access in ad hoc networks", IEEE Computer 37 (2) (2004) 32–39.
[5]. Shailender Gupta, C. K. Nagpal and Charu Singla, "IMPACT OF SELFISH NODE CONCENTRATION IN MANETS" International Journal of Wireless & Mobile Networks (IJWMN) Vol. 3, No. 2, April 2011.
[6]. Yang Zhang, Student Member, IEEE, Liangzhong Yin, Jing Zhao, and Guohong Cao, Fellow, IEEE, "Balancing the Tradeoffs between Query Delay and Data Availability in MANETs", IEEE Transactions On Parallel And Distributed Systems.
[7]. T. Hara, "Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility," Proc. IEEE INFOCOM, pp. 1568- 1576, 2001.
[8]. T. Hara and S.K. Madria, "Data Replication for Improving Data Accessibility in Ad Hoc Networks," IEEE Trans. Mobile Computing, vol. 5, no. 11, pp. 1515-1532, Nov. 2006.
[9]. L.J. Mester, "What‟s the Point of Credit Scoring?" Business Rev.pp. 3-16, Sept. 1997.
[10]. Y. Liu and Y. Yang, "Reputation Propagation and Agreement in Mobile Ad-Hoc Networks," Proc. IEEE Wireless Comm. And Networking Conf., pp. 1510-1515,

Abstract: Cloud storage enables users to remotely store their data and enjoy the on-demand high quality cloud applications without the burden of local hardware and software management. Though the benefits are clear, it inevitably poses new security risks toward the correctness of the data in cloud. To address this problem, the proposed design allows users to audit the cloud storage with very lightweight communication and computation cost by utilizing the new cryptographic technique like homomorphic token and distributed erasure-coded data. By introducing the notion of parallel homomorphic encryption (PHE) schemes, which are encryption schemes that support computation over encrypted data via evaluation algorithms that can be efficiently executed in parallel. In addition, we can hide the function being evaluated with the MapReduce model runnable on Hadoop framework for element testing and keyword search. Analysis shows the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks and attempting to strike a balance between security, efficiency and functionality using Kerberos protocol and HDFS system.

[1] Amazon elastic mapreduce. See http://aws.amazon.com/elasticmapreduce.
[2] Cloudera. See http://cloudera.com.
[3] Powered by hadoop. See http://wiki.apache.org/hadoop/PoweredBy.
[4] Yahoo! launches world's largest hadoop production application. See http://developer.yahoo. net/blogs/hadoop/2008/02/yahoo-worlds-largest-production-hadoop.html, 2008.
[5] M. Abadi, J. Feingenbaum, and J. Killian. On hiding information from an oracle. In ACM Symposium on Theory of Computing (STOC 1987), pages 195{203, 1987.
[6] B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. Journal of Computational Complexity, 15(2), 2006.
[7] B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC0. SIAM Journal of Computation,
36(4):845{888, December 2006.
[8] B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography with constant input locality. In Advances in Cryptology - CRYPTO '07, Lecture Notes in Computer Science, pages 92{110. Springer-Verlag, 2007. 19 (CCS '07), pp. 584-597, Oct. 2007.
[9] B. Krebs, "Payment Processor Breach May Be Largest Ever," http://voices.washingtonpost.com/securityfix/2009/ 01/
payment_processor_breach_may_b.html, Jan. 2009.
[10] A. Juels and B.S. Kaliski Jr., "PORs: Proofs of Retrievability for Large Files," Proc. 14th ACM Conf. Computer and Comm. Security (CCS '07), pp. 584-597, Oct. 2007.