HASS: Highly Available, Scalable and Secure Distributed Data Storage Systems

Xu, Zhijie; Jiang, Hai

doi:10.1109/cse.2009.70

Cited by 11 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, a few distributed in-network data storage and retrieval schemes [Ye et al 2002;RatNasamy et al 2002;Zhang et al 2003;Newsome and Song 2003;Greenstein et al 2003;Li et al 2003;Ghose et al 2003;Desnoyers et al 2005;Fang et al 2006] have been proposed for efficient data management. In distributed in-network data storage schemes such as TTDD [Ye et al 2002], DCS [RatNasamy et al 2002;Newsome and Song 2003], TSRA [Desnoyers et al 2005], HybridS [Ren et al 2008], HASS [Xu and Jiang 2009], and ZettaDS [Liu et al 2008], the landmark-based information brokerage system [Fang et al 2006] and others Greenstein et al 2003;Li et al 2003;Ghose et al 2003], the data collected by a sensor node is stored either locally or at some designated nodes in the network, instead of transferred immediately to a centralized data center that is usually located out of the network. In our proposed work, a fully distributed data storage scheme is deployed, where the data collected are stored locally on individual nodes.…”

Section: Related Workmentioning

confidence: 99%

Defending against Frequency-Based Attacks on Distributed Data Storage in Wireless Networks

Liu

Wang

Chen

et al. 2014

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

As wireless networks become more pervasive, the amount of the wireless data is rapidly increasing. One of the biggest challenges of wide adoption of distributed data storage is how to store these data securely.In this work, we study the frequency-based attack, a type of attack that is different from previously wellstudied ones, that exploits additional adversary knowledge of domain values and/or their exact/approximate frequencies to crack the encrypted data. To cope with frequency-based attacks, the straightforward 1-to-1 substitution encryption functions are not sufficient. We propose a data encryption strategy based on 1-to-n substitution via dividing and emulating techniques to defend against the frequency-based attack, while enabling efficient query evaluation over encrypted data. We further develop two frameworks, incremental collection and clustered collection, which are used to defend against the global frequency-based attack when the knowledge of the global frequency in the network is not available. Built upon our basic encryption schemes, we derive two mechanisms, direct emulating and dual encryption, to handle updates on the data storage for energy-constrained sensor nodes and wireless devices. Our preliminary experiments with sensor nodes and extensive simulation results show that our data encryption strategy can achieve high security guarantee with low overhead. . 2014. Defending against frequency-based attacks on distributed data storage in wireless networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Defending against Frequency-Based Attacks on Distributed Data Storage in Wireless Networks

Liu

Wang

Chen

et al. 2014

ACM Trans. Sen. Netw.

View full text Add to dashboard Cite

show abstract

“…New node can be added to the system for increasing storage capacity. DFS usually adopt security schemas for preventing data corruption and data stealing [4], [5], [6].…”

Section: Introductionmentioning

confidence: 99%

Simulation of client-side caching policies for distributed file systems

Bzoch

Safarink

2013

Eurocon 2013

View full text Add to dashboard Cite

Cache as an intermediate component serves for storing content which has been requested by user and will be potentially used in the future. The cache capacity is limited, thus we cannot store all requested content. We have to use algorithms which mark an old content to be replaced in the cache. These algorithms are commonly named cache or caching policies. Optimally, the caching policy should replace the content which will not be used in the near future. First goal of this paper is to present a cache simulator which serves for comparison of caching policies. In a simulation, requests for data are produced by random request generator or can be generated from a log file. The second goal of this paper is to present results gained from simulations of different caching policies applicable to mobile devices and other clients in order to choose most suitable one.

show abstract

“…Currently, existing methods, e.g. (Gabber et al, 2003), (Xu and Jiang, 2009) barely address medical data management needs beyond the specific depart-ment's boundaries, while it is known that the patient medical folders are wide spread over many medical sites involved in the patient's healthcare. For this reason, many efforts have been done in last years to develop an interoperable infrastructure for digital health ((Cheung et al, 2009), (Freund, 2006)) by using semantic web concepts, even if the attention is mainly oriented to metadata sharing.…”

Section: Introductionmentioning

confidence: 99%

Nuclear Medicine Image Management System for Storage and Sharing by Using Grid Services and Semantic Web

Giordano

Pino

Spampinato

et al. 2011

Proceedings of the International Conference on Health Informatics

View full text Add to dashboard Cite

Large amounts of images (SPECT, PET, scintigraphy) in the nuclear medicine field have been routinely produced in the last decades. In this paper we propose an image management system that allows nuclear medicine physicians to share the acquired images and the associated metadata both locally (i.e. within the same medical institute) and globally with other nuclear medicine physicians located anywhere in the world by using GRID services for data (LFC) and metadata (AMGA) storage. The proposed system guarantees medical data protection by anonymization that removes most sensitive data for unauthorized users, and encryption, that guarantees data protection when it is stored at remote sites. Another important issue is that often nuclear medicine data is associated with other medical data (e.g. neurological data) for diagnosis and therapy follow-up. In order to correlate images with other clinical information, the common metadata are enriched by developing a controlled vocabulary, which integrates known standards such as FOAF, CCR and GeneOntology. All the metadata are stored in an RDF (Resource Description Framework) repository in order to make the system fully compatible with existing metadata storage systems following the semantic web's philosophy.

show abstract

HASS: Highly Available, Scalable and Secure Distributed Data Storage Systems

Cited by 11 publications

References 13 publications

Defending against Frequency-Based Attacks on Distributed Data Storage in Wireless Networks

Defending against Frequency-Based Attacks on Distributed Data Storage in Wireless Networks

Simulation of client-side caching policies for distributed file systems

Nuclear Medicine Image Management System for Storage and Sharing by Using Grid Services and Semantic Web

Contact Info

Product

Resources

About