Filters








14,612 Hits in 6.1 sec

Secrecy and Accessibility in Distributed Storage [article]

Lukas Holzbaur, Stanislav Kruglik, Alexey Frolov, Antonia Wachter-Zeh
2020 arXiv   pre-print
A distributed storage system (DSS) needs to be efficiently accessible and repairable.  ...  Further, we establish methods to balance the access load, i.e., ensure that each node is accessed equally often.  ...  In what follows we assume a uniform distribution on X.  ... 
arXiv:2001.05337v1 fatcat:fb4en3y7jfbvlo5k25d4jffhcu

On secure distributed data storage under repair dynamics

Sameer Pawar, Salim El Rouayheb, Kannan Ramchandran
2010 2010 IEEE International Symposium on Information Theory  
We are interested in determining the secrecy capacity of distributed storage systems under repair dynamics, i.e., the maximum amount of data that can be securely stored and made available to a legitimate  ...  We derive a general upper bound on the secrecy capacity and show that this bound is tight for the bandwidth-limited regime which is of importance in scenarios such as peer-to-peer distributed storage systems  ...  In Section V, we derive an upper bound on the secrecy capacity of a distributed storage system.  ... 
doi:10.1109/isit.2010.5513795 dblp:conf/isit/PawarRR10 fatcat:jujq5ecoxjepfjsv3njucqfmru

Parallel network file systems using authenticated key exchange protocols

S. Sathya, M. Ranjith Kumar, K. Madheswaran
2017 Journal of Applied and Advanced Research  
The problem is inspired by the proliferation of large-scale distributed file systems supporting parallel access to multiple storage devices.  ...  This shows that these protocols are capable of reducing the workload of the metadata server and concurrently supporting forward secrecy and escrow-freeness.  ...  In a parallel file system, file data is distributed across multiple storage devices or nodes to allow concurrent access by multiple tasks of a parallel application.  ... 
doi:10.21839/jaar.2017.v2i3.89 fatcat:3hdi7oxhpzd73fcnfref6ou6se

Distributed Multi-User Secret Sharing [article]

Mahdi Soleymani, Hessam Mahdavifar
2020 arXiv   pre-print
We consider a distributed secret sharing system that consists of a dealer, n storage nodes, and m users.  ...  Given a certain number of storage nodes we find the maximum number of users that can be served in such a system and construct schemes that achieve this with perfect secrecy.  ...  However, as pointed out in [19] in the context of distributed storage, the perfect secrecy is too strong for certain practical distributed storage systems and may result in extremely large storage overhead  ... 
arXiv:1801.04384v4 fatcat:b4hjpn2pqrdm5ik4dhhkrz43am

Secure partial secret key issuing in Certificateless Public Key Infrastructure

Seyedehnegin Mehrasa, Nazrul M. Ahmad, Alireza Khorram, Asrul H. Yaacob
2011 2011 IEEE Student Conference on Research and Development  
In this paper we propose a scheme known as Partial key Distribution for DTN"s for securing the secret keys and confidential data.  ...  In hostile environments storing and retrieving of data from these storage nodes becomes complicated.  ...  These storage nodes are introduced by Roy [2] and Chuah [3] . The information stored in storage nodes is only accessed by authorized mobile nodes.  ... 
doi:10.1109/scored.2011.6148712 fatcat:bfdk67u5njbsdlzkorxmgdmnli

Cloud And Parallel Network File System Using Authenticated Key Exchange Protocols

2016 International Journal of Science and Research (IJSR)  
The main problem is inspired by the proliferation of large-scale distributed file systems supporting parallel access to multiple storage devices.  ...  storage devices, and this inherently leads to key escrow. .  ...  Introduction In a parallel file system, file data is distributed across multiple storage devices or nodes to allow concurrent access by multiple tasks of a parallel application.  ... 
doi:10.21275/v5i5.nov163973 fatcat:zem74bm3wvbtjmvdsvey2egx4a

Secure Clustered Distributed Storage Against Eavesdroppers [article]

Beongjun Choi, Jy-yong Sohn, Sung Whan Yoon, Jaekyun Moon
2017 arXiv   pre-print
Noticing that actual storage nodes constituting a DSS are distributed in multiple clusters, two novel eavesdropper models - the node-restricted model and the cluster-restricted model - are suggested which  ...  This paper considers the security issue of practical distributed storage systems (DSSs) which consist of multiple clusters of storage nodes.  ...  Section II reviews the dynamic structure of the distributed storage system and secrecy capacity. In Sections III and IV, we suggest and analyze two eavesdropper models.  ... 
arXiv:1702.07498v1 fatcat:ijrbojurlbgwlbsqzf2bx5yomi

Information-Theoretically Secure Regenerating Codes for Distributed Storage

N. B. Shah, K. V. Rashmi, P. V. Kumar
2011 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011  
In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes  ...  Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair.  ...  Definition 1 ({ , } secure distributed storage system): Consider a distributed storage system in which an eavesdropper gains access to the data stored in some ( − ) nodes, and the data stored as well as  ... 
doi:10.1109/glocom.2011.6133754 dblp:conf/globecom/ShahRK11 fatcat:vhgcdfmsyfhodiovdgxt66a6su

Information-theoretically Secure Regenerating Codes for Distributed Storage [article]

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar
2011 arXiv   pre-print
In this paper, we consider a threat model where an eavesdropper may gain access to the data stored in a subset of the storage nodes, and possibly also, to the data downloaded during repair of some nodes  ...  Regenerating codes are a class of codes for distributed storage networks that provide reliability and availability of data, and also perform efficient node repair.  ...  Definition 1 ({ℓ, ℓ ′ } secure distributed storage system): Consider a distributed storage system in which an eavesdropper gains access to the data stored in some (ℓ − ℓ ′ ) nodes, and the data stored  ... 
arXiv:1107.5279v1 fatcat:rvnq2uy6p5fjxbpmsruvccxzxy

Long-term threats to secure archives

Mark W. Storer, Kevin Greenan, Ethan L. Miller
2006 Proceedings of the second ACM workshop on Storage security and survivability - StorageSS '06  
These security threats endanger the secrecy, availability and integrity of the archival storage contents.  ...  Secure archival storage has the added goal of providing controlled access to its long-term contents. In contrast, public archival systems aim to ensure that their contents are available to anyone.  ...  Acknowledgments We thank Kaladhar Voruganti and the other members of the Storage Systems Research Center (SSRC) for spirited discussions that helped focus the content of this paper.  ... 
doi:10.1145/1179559.1179562 dblp:conf/storagess/StorerGM06 fatcat:bvjcbslmibfitgqu7yczxjtnxa

SECURITY IN DISTRIBUTED STORAGE SYSTEMS – ENCRYPTION ALGORITHM VS. CODING SCHEMES

Nataša Paunkoska
2019 Journal of Electrical Engineering and Information Technologies  
The concept for data distribution and storage play important role for obtaining efficient, reliable and secure system.  ...  A b s t r a c t: Distributed storage systems (DSS) are crucial for managing large amount of data produced on daily bases.  ...  In [23] are define the secrecy and resiliency capacities of a distributed storage system as the maximum amount of information that it can store safely, respectively, in the presence of an eavesdropper  ... 
doi:10.51466/jeeit1941-2051p fatcat:hdzhkitrarfxdjtpimokblibpm

An Efficient Scheme for Facilitating Secure Data Sharing in Decentralized Disruption Tolerant Networks

M. S. Sarath Chandra, K. Raghava Rao, Mohammed Ali Hussain
2016 Indian Journal of Science and Technology  
environments in an efficient and a secured manner.  ...  We've been successful in implementing this system to achieve the security requirements we've been discussing at length in the paper and we've demonstrated how to recover the data in very hostile military  ...  This work wouldn't have been completed without the University Support and we're forever thankful. Our special thanks to, "Embedded Systems and Sensor Networks (ESSN)" research group of K L U.  ... 
doi:10.17485/ijst/2016/v9i5/84915 fatcat:gddwghqoj5awbpqz4espjmxxxm

Secure locally repairable codes for distributed storage systems

Ankit Singh Rawat, O. Ozan Koyluoglu, Natalia Silberstein, Sriram Vishwanath
2013 2013 IEEE International Symposium on Information Theory  
Towards this, novel upper bounds on secrecy capacity for minimum storage regenerating (MSR) codes and locally repairable codes (LRCs) are derived.  ...  This paper presents coding schemes for distributed storage systems (DSS) that are secure against eavesdroppers, while simultaneously enabling efficient node repair (regeneration).  ...  Eavesdropper model and proof of secrecy In [11] , Pawar et al. consider a passive eavesdropper with access to the data stored on (< k) storage nodes.  ... 
doi:10.1109/isit.2013.6620621 dblp:conf/isit/RawatKSV13 fatcat:x7megmjs3naz7jheygvxp2rh7q

Keeping data secret under full compromise using porter devices

Christina Pöpper, David Basin, Srdjan Čapkun, Cas Cremers
2010 Proceedings of the 26th Annual Computer Security Applications Conference on - ACSAC '10  
We propose two new solutions that use explicit key deletion and forward-secret protocols combined with key storage on porter devices. Our solutions provide the users with control over their privacy.  ...  We formalize this problem and explore solutions that provide confidentiality after the full compromise of devices and user passwords.  ...  The storage may be centralized (e. g., a remote server [28] ), or distributed [21] ; distributed storage requires key sharing.  ... 
doi:10.1145/1920261.1920297 dblp:conf/acsac/PopperBCC10 fatcat:ihjgal7u7rdqzgkohecmbbnkp4

An Overflow Problem in Network Coding for Secure Cloud Storage [article]

Yu-Jia Chen, Li-Chun Wang
2017 arXiv   pre-print
Thanks to considering both security and storage requirements in encoding procedures and distributed architectures, the NCSS can improve the performance of a cloud storage system from both the aspects of  ...  In this paper we define the overflow problem of a network coding storage system in which the encoding parameter and the storage parameter are mismatched.  ...  The authors of [22] considered how to achieve the information-theoretical secrecy when an eavesdropper can access some data in the storage nodes.  ... 
arXiv:1702.05346v1 fatcat:xgovzwapsfdghllh7en2s4sl5q
« Previous Showing results 1 — 15 out of 14,612 results