Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

6 results for “Hash Technique”

Set a search alert
Research ArticleOpen accessIn the keywordsAuthentication Based and Optimized Routing Technique in Mobile Ad hoc NetworksS. Varadhaganapathy, A. M. Natarajan, S. N. SivanandamProblem statement: An Ad hoc network has been defined as a self-organizing, dynamic topology network formed by a group of wireless mobile nodes. Minimal configuration, absence of infrastructure and quick deployment, would make ad hoc networks convenient for emergency situations other than military applications. In recent years, security in Ad hoc Networks as a research topic had started to receive … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,903 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSecurity based Approach of SHA 384 and SHA 512 Algorithms in Cloud EnvironmentThambusamy Velmurugan, Sivakumar KarthigaCloud computing is going to be the next big thing in the era of internet world. As the world moves ahead towards enhancement of the cloud features we also have to take a serious consideration of the enhancing cloud securities to protect the end-user’s data. The major usage of this cloud feature are widely applied in the cloud based IT … …Journal of Computer Science, Vol. 16, Issue 10 · 28 Oct 2020 · 6,841 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Dynamically Zero Trust and Risk Aware Cryptographic Orchestration Framework of Secure Multi Cloud Electronic Health RecordsD. Veerabhadra Rao, G. Appa Rao, S. AnuradhaThe adoption of multi-cloud infrastructures for Electronic Health Records (EHRs) improves scalability and accessibility but introduces security challenges such as fragmented trust management, high cryptographic overhead, and inefficient integrity verification. Existing frameworks rely on static authorization and uniform encryption mechanisms, which fail to dynamically evaluate behavioural risks associated with user access requests. Consequently, Distributed Trust Inconsistency, Cryptographic Scalability Saturation, and … …Journal of Computer Science, Vol. 22, Issue 10 · 7 Oct 2026 · 453 accessesView PDFCite
Research ArticleOpen accessIn the abstractHybrid Algorithm for Optimal Load Sharing in Grid ComputingD. Ramesh, A. KrishnanProblem statement: Grid Computing is the fast growing industry, which shares the resources in the organization in an effective manner. Resource sharing requires more optimized algorithmic structure, otherwise the waiting time and response time are increased and the resource utilization is reduced. Approach: In order to avoid such reduction in the performances of the grid system, an optimal resource sharing … …Journal of Computer Science, Vol. 8, Issue 1 · 5 Nov 2011 · 7,521 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordCombined Heuristic Technique for Optimization of Bloom Filter in Spam FilteringArulanand Natarajan, S. Subramanian, K. PremalathaProblem statement: Spam is an irrelevant or inappropriate message sent on the internet to a large number of newsgroups or users. A spam word is a list of well-known words that often appear in spam mails. Bloom Filter (BF) is used for identification of spam word. Approach: BF is a simple but powerful data structure that can check membership to … …Journal of Computer Science, Vol. 7, Issue 9 · 27 Jul 2011 · 7,226 accessesView PDFCite
Research ArticleOpen accessAll words, across the recordAn Improved Scheme for Digital Watermarking Using Functional Link Artificial Neural NetworkBanshidhar Majhi, Hasan ShalabiThe present study proposes a novel technique for copyright protection by utilizing digital watermarking of Images. The watermark is embedded and detected by using Functional Link Artificial Neural Network (FLANN) and Discrete Cosine Transform (DCT). The exhaustive simulation results of the proposed scheme show improved performance over the existing methods in all cases, i.e. when the watermarked image is subjected … …Journal of Computer Science, Vol. 1, Issue 2 · 30 Jun 2005 · 6,861 accessesView PDFCite