Key agreement based secure Kerberos authentication  protocol (KASKAP) for distributed database  access in secured manner

Distributed database is a collection of multiple databases that can be stored at different network sites. It acts as an important role in today’s world intended for storing and retrieving huge data. The implementation of distributed database advantages such as data replication, low operating costs, faster data transaction and data processing, but security is still a significant problem. In this paper make clear to explain security issues of distributed database and give the suggestion to improve security of distributed database. Subsequently, secured distributed database design in light of trusted node is proposed. The design contains a unique node in a system called a trusted node for each site through which every single other node will get to the database. Trusted node process client demands, joins the outcomes from concerned distributed databases and forward it to the confirmed client. The system adjusted by the trusted nodes keeping in mind the end goal to give authentication is Key Agreement based Secure Kerberos Authentication Protocol (KASKAP). Hence authenticated users can only access the database.

Download Full-text

ADVANCED TECHNOLOGIES FOR DISTRIBUTED DATABASE SERVICES HYPERINFRASTRUCTURE

International Journal of Modern Physics A ◽

10.1142/s0217751x05027862 ◽

2005 ◽

Vol 20 (16) ◽

pp. 3877-3879 ◽

Cited By ~ 1

Author(s):

ALEXANDRE VANIACHINE ◽

DAVID MALON ◽

MATTHEW VRANICAR

Keyword(s):

Data Processing ◽

Data Access ◽

Distributed Database ◽

Lessons Learned ◽

Heterogeneous Databases ◽

Event Data ◽

Production Environment ◽

Database Access ◽

Access Methods ◽

Secure Data

HEP collaborations are deploying grid technologies to address petabyte-scale data processing challenges. In addition to file-based event data, HEP data processing requires access to terabytes of non-event data (detector conditions, calibrations, etc.) stored in relational databases. Inadequate for non-event data delivery in these amounts, database access control technologies for grid computing are limited to encrypted message transfers. To overcome these database access limitations one must go beyond the existing grid infrastructure. A proposed hyperinfrastructure of distributed database services implements efficient secure data access methods. We introduce several technologies laying a foundation of a new hyperinfrastructure. We present efficient secure data transfer methods and secure grid query engine technologies federating heterogeneous databases. Lessons learned in a production environment of ATLAS Data Challenges are presented.

Download Full-text

Query Computation Time and Its Performance over Distributed Database Frameworks

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.l2769.1081219 ◽

2019 ◽

Vol 8 (12) ◽

pp. 5153-5160

Keyword(s):

Data Privacy ◽

Privacy Preservation ◽

Clustering Algorithms ◽

Distributed Databases ◽

Computation Time ◽

Distributed Database ◽

Vital Role ◽

Data Set ◽

Security Issues ◽

Distributed Database System

It is essential to maintain a relevant methodology for data fragmentation to employ resources, and thus, it needs to choose an accurate and efficient fragmentation methodology to improve authority of distributed database system. This leads the challenges on data reliability, stable storage space and costs, Communication costs, and security issues. In Distributed database framework, query computation and data privacy plays a vital role over portioned distributed databases such as vertical, horizontal and hybrid models, Privacy of any information is regarded as the essential issue in nowadays hence we show an approach by that we can use privacy preservation over the two parties which are actually distributing their data horizontally or vertically. In this chapter, I present an approach by which the concept of hierarchal clustering applied over the horizontally partitioned data set. We also explain the desired algorithm like hierarchal clustering, algorithms for finding the minimum closest cluster. Furthermore, it explores the performance of Query Computation over portioned databases with the analysis of Efficiency and Privacy.

Download Full-text

An open framework for biodiversity databases

10.1101/010405 ◽

2014 ◽

Author(s):

Miklós Bán ◽

Zsolt Végvári ◽

Sándor Bérces

Keyword(s):

Data Processing ◽

National Parks ◽

Web Application ◽

Distributed Database ◽

Data Service ◽

Database Access ◽

Open Framework ◽

Web Map ◽

Biodiversity Databases

OpenBioMaps is a recently developed, open and free web application with distributed database background, operated by several universities and national parks. This system provides free web map services and open database access by using standard OGC protocols. One of its' main features is that users can create new and unique database projects. The databases involved are maintained by the data providers themselves. Standard tools supplied to the users include repeatable and referable data queries, exporting, evaluations and tracking of data changes. The system also provides a programmable data service for promoting data processing.

Download Full-text