in this research work, the impact of user’s behavior on search engine results is discussed. it aims to improvement of search results which leads to the higher satisfaction of users. in other words, we are trying to present a personalized search engine for each user, based on his/her activity and search history. we base our hypothesis that the search history of each user in a specific time frame...

this paper considers the search problem, introduced by srivastava cite{sr}. this is a model discrimination problem. in the context of search linear models, discrimination ability of search designs has been studied by several researchers. some criteria have been developed to measure this capability, however, they are restricted in a sense of being able to work for searching only one possible non...

Objective The present review aimed to examine the relationship between attachment styles and posttraumatic growth in adults exposed traumatizing events. Method A systematic literature search resulted inclusion of 14 studies review. Four correlational meta-analyses secure, dismissive, preoccupied, fearful, growth, were conducted. Results These revealed a significant small positive secure (r = 0....

Searchable encryption allows one to store encrypted documents on a remote honest-butcurious server, and query that data at the server itself without requiring the documents to be decrypted prior to searching. This not only protects the data from the prying eyes of the server, but can also reduce the communication overhead between the server and the user and local processing at the latter. Previ...

Majority of data owners have moved their services to the cloud servers. Members any organization can access from by using keyword-based search. Being based on Boolean keyword matching system or semantic search they are unable provide accurate results as well understand misspelled keywords. With existing searching mechanisms like in place, often slow and result missing information produce result...

Post-quantum cryptography has attracted much attention from worldwide cryptologists. In ISIT 2010, Kuwakado and Morii gave a quantum distinguisher with polynomial time against 3-round Feistel networks. However, generalized Feistel schemes (GFS) have not been systematically investigated against quantum attacks. In this paper, we study the quantum distinguishers about some generalized Feistel sch...

Searchable Symmetric Encryption (SSE) has been widely applied in the design of encrypted database for exact queries or even range queries in practice. In spite of its efficiency and functionalities, it always suffers from information leakages. Some recent attacks point out that forward privacy is the desirable security goal. However, there are only a very small number of schemes achieving this ...

Volume 6, Issue 5, September – October 2017 Page 98 Abstract: Cloud computing yields a variety of advantages like high storage space, shared resources and less management etc. Searchable encryption schemes are implemented to store the encrypted data. But this approach suffers from lack of security. To overcome this problem, a new tree based structure having Greedy Depth First Search algorithm i...

We revisit the concept of public key encryption with delegated keyword search (PKEDS), a concept proposed by Ibraimi et al. A PKEDS scheme allows a receiver to authorize third-party server(s) to search in two ways: either according to a message chosen by the server itself or according to a trapdoor sent by the receiver. We show that the existing formulation has some defects and the proposed sch...