A Theoretical Analysis for relevancy of files in Enhanced Ranking Based Cloud Search with Improved Metadata Storage
Rajpreet Kaur and Manish Mahajan
Abstract
With the outgrowth of cloud computing, a large amount of private information is stored over cloud servers, which is in encrypted format. But searching over encrypted data is very difficult. Earlier search schemes were based on Boolean search through keywords. But don’t consider relevance of files. After that ranked search comes into its role, which uses searchable symmetric encryption (SSE). To achieve more practical and efficient design method was further modified to “Order preserving symmetric encryption” (OPSE), which uses primitives and indexed metadata files used in ranked SSE. In this proposed work further enhancements are done to reduce storage space for encrypted metadata using Porter Stemming method. Improvements in retrieval time are also done by using Boyer Moore’s searching algorithm.
Download Full Text 
Design of Optimized Symmetric Key Encryption Algorithm for Increasing Security
Apoorva Hora, Namrata Sahayam
Abstract
Design of optimized symmetric key encryption algorithm for increasing security had been covered in this paper using International Data Encryption Algorithm (IDEA). The current era has seen an explosive growth in communication. Applications like online banking, personal digital assistants, mobile communication, smartcards, etc. have emphasized the need for security in resource constrained environment. International Data Encryption Algorithm (IDEA) cryptography serves as a perfect encryption tool because of its 128 bits key sizes and high security comparable to that of other algorithms. However, to match the ever increasing requirement for speed in today’s applications, hardware acceleration of the cryptographic algorithms is a necessity. This study presents an efficient hardware structure for the modulo (2n + 1) Multiplier and modulo(2n ) adder which is the most time and space consuming operation in IDEA. The proposed design saves more time, area and cost. The block size considered here is same as of traditional IDEA encryption algorithm which is of 64 bits with 16 bit sub-blocks.
Download Full Text
The Views on Happiness: A Dialectic Approach
Nailesh Limbasiya
Abstract
In the era of commercialization and industrialization, people work day and night to survive in the market. In the struggle of survival, they forget the real meaning of the life. They measure everything in terms of the money. They forget that “Sat”—“Chit”—“Ananda” is the real form of a human being. Human beings in their life pursuing in the search of a true happiness. They identify the man, money, and material as the real source of happiness. Throughout their life, they seek happiness from each of these sources. In fact, they fail to get the same. The present paper is an attempt to reveal the views of ancient Indian scripture on happiness. The paper uses the dialectic method to prove and disprove the various definitions of happiness. The definitions pointing to the material happiness; physical happiness; sensual happiness; intellectual happiness; psychological happiness; and spiritual happiness have been studied. The paper concludes the scope of various sources of happiness. The article ends with various auspicious (Aum Aano Bhadra) things explained in our ancient Indian scripture that can be the sources of happiness.
Download Full Text
end faq