Implementation of a Privacy Preserving and Loss Data Retrieval System for Cloud Environment

2020 ◽  
Author(s):  
Satti Rami Reddy ◽  
Satti Mouli Satti Reddy ◽  
Suja Cherukullapurath Mana ◽  
B.Keerthi Samhitha ◽  
Jithina Jose
Keyword(s):  
Retrieval System ◽  
Data Retrieval ◽  
Privacy Preserving ◽  
Cloud Environment ◽  
Loss Data

Privacy Preserving in Cloud Environment for Obstructed Shortest Path Query

2017 ◽  
Vol 96 (2) ◽  
pp. 2305-2322 ◽  
Author(s):  
Lei Zhang ◽  
Jing Li ◽  
Songtao Yang ◽  
Bin Wang
Keyword(s):  
Shortest Path ◽  
Privacy Preserving ◽  
Cloud Environment ◽  
Shortest Path Query

scholarly journals Development of parser agents for bibliographic data retrieval

2018 ◽  
Vol 33 (4) ◽  
Author(s):  
Murari Kumar ◽  
Samir Farooqi ◽  
K. K. Chaturvedi ◽  
Chandan Kumar Deb ◽  
Pankaj Das
Keyword(s):  
Retrieval System ◽  
Data Retrieval ◽  
Web Pages ◽  
Bibliographic Database ◽  
Bibliographic Information ◽  
Open Access Journals ◽  
Bibliographic Records ◽  
Bibliographic Data ◽  
Structured Information ◽  
The Web

Bibliographic data contains necessary information about literature to help users to recognize and retrieve that resource. These data are used quantitatively by a “Bibliometrician” for analysis and dissemination purpose but with the increasing rate of literature publication in open access journals such as Nucleic Acids Research (NAR), Springer, Oxford Journals etc., it has become difficult to retrieve structured bibliographic information in desired format. A digital bibliographic database contains necessary and structured information about published literature. Bibliographic records of different articles are scattered and resides on different web pages. This thesis presents the retrieval system for bibliographic data of NAR at a single place. For this purpose, parser agents have been developed which access the web pages of NAR and parse the scattered bibliographic data and finally store it into a local bibliographic database. Based on the bibliographic database, “three-tier architecture” has been utilized to display the bibliographic information in systematized format. Using this system, it would be possible to build the network between different authors and affiliations and also other analytical reports can be generated.

scholarly journals Study of privacy-preserving framework for cloud storage

2011 ◽  
Vol 8 (3) ◽  
pp. 801-819 ◽  
Author(s):  
Huang Ruwei ◽  
Gui Xiaolin ◽  
Yu Si ◽  
Zhuang Wei
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Security Analysis ◽  
Bloom Filter ◽  
Data Access ◽  
Data Retrieval ◽  
Privacy Preserving ◽  
Index Structure ◽  
Structure Generation ◽  
Access Right

In order to implement privacy-preserving, efficient and secure data storage and access environment of cloud storage, the following problems must be considered: data index structure, generation and management of keys, data retrieval, treatments of change of users? access right and dynamic operations on data, and interactions among participants. To solve those problems, the interactive protocol among participants is introduced, an extirpation-based key derivation algorithm (EKDA) is designed to manage the keys, a double hashed and weighted Bloom Filter (DWBF) is proposed to retrieve the encrypted keywords, which are combined with lazy revocation, multi-tree structure, asymmetric and symmetric encryptions, which form a privacypreserving, efficient and secure framework for cloud storage. The experiment and security analysis show that EKDA can reduce the communication and storage overheads efficiently, DWBF supports ciphertext retrieval and can reduce communication, storage and computation overhead as well, and the proposed framework is privacy preserving while supporting data access efficiently.

scholarly journals STATUS OF DATA RETRIEVAL SYSTEM AS OF APRIL 1, 1969

1969 ◽  
Author(s):  
R. L. Reynolds ◽  
R. L. Engel ◽  
R. T. Toyooka ◽  
E. L. Wells
Keyword(s):  
Retrieval System ◽  
Data Retrieval

scholarly journals Composite Materials Design Database and Data Retrieval System Requirements

1994 ◽  
Vol 116 (2) ◽  
pp. 531-538
Author(s):  
W. J. Rasdorf
Keyword(s):  
Composite Materials ◽  
Computer Technology ◽  
Retrieval System ◽  
Data Retrieval ◽  
Data Representation ◽  
Clear Understanding ◽  
Analysis And Design ◽  
Problems And Solutions ◽  
System Requirements ◽  
Design Software

Researchers and materials engineers require a greater understanding of the problems and solutions that emerge when integrating composite materials data with computer technology so that utilitarian composite materials databases can be developed to effectively and efficiently support analysis and design software. This paper primarily serves to analyze several of the problems facing developers of composite materials databases, evolving from the complexity of the materials themselves and from the current lack of testing and data representation standards. Without a clear understanding of the scope and nature of these problems, there is no possibility of designing concise yet comprehensive composites data models, yet we feel that such an understanding is presently lacking.

Privacy-Preserving Outsourced Similarity Search

2014 ◽  
Vol 25 (3) ◽  
pp. 48-71 ◽  
Author(s):  
Stepan Kozak ◽  
David Novak ◽  
Pavel Zezula
Keyword(s):  
Similarity Search ◽  
Data Privacy ◽  
System Analysis ◽  
Keyword Search ◽  
Evaluation Criteria ◽  
Similarity Index ◽  
Data Retrieval ◽  
Privacy Preserving ◽  
Scientific Data ◽  
Sensitive Data

The general trend in data management is to outsource data to 3rd party systems that would provide data retrieval as a service. This approach naturally brings privacy concerns about the (potentially sensitive) data. Recently, quite extensive research has been done on privacy-preserving outsourcing of traditional exact-match and keyword search. However, not much attention has been paid to outsourcing of similarity search, which is essential in content-based retrieval in current multimedia, sensor or scientific data. In this paper, the authors propose a scheme of outsourcing similarity search. They define evaluation criteria for these systems with an emphasis on usability, privacy and efficiency in real applications. These criteria can be used as a general guideline for a practical system analysis and we use them to survey and mutually compare existing approaches. As the main result, the authors propose a novel dynamic similarity index EM-Index that works for an arbitrary metric space and ensures data privacy and thus is suitable for search systems outsourced for example in a cloud environment. In comparison with other approaches, the index is fully dynamic (update operations are efficient) and its aim is to transfer as much load from clients to the server as possible.

Sign in / Sign up

Export Citation Format

Share Document