Sciweavers

27 search results - page 3 / 6
» Optimal Resilience for Erasure-Coded Byzantine Distributed S...
Sort
View
CN
2011
140views more  CN 2011»
12 years 9 months ago
Towards the design of optimal data redundancy schemes for heterogeneous cloud storage infrastructures
Nowadays, data storage requirements from end-users are growing, demanding more capacity, more reliability and the capability to access information from anywhere. Cloud storage ser...
Lluis Pamies-Juarez, Pedro García Ló...
INFOCOM
2009
IEEE
14 years 11 days ago
Dependable and Secure Sensor Data Storage with Dynamic Integrity Assurance
Abstract—Recently, distributed data storage has gained increasing popularity for efficient and robust data management in wireless sensor networks (WSNs). But the distributed arc...
Qian Wang, Kui Ren, Wenjing Lou, Yanchao Zhang
PODC
2009
ACM
14 years 6 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
TDSC
2010
218views more  TDSC 2010»
13 years 4 months ago
Secure Data Objects Replication in Data Grid
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
Manghui Tu, Peng Li, I-Ling Yen, Bhavani M. Thurai...
INFOCOM
2007
IEEE
14 years 1 days ago
Resilient Network Coding in the Presence of Byzantine Adversaries
Abstract— Network coding substantially increases network throughput. But since it involves mixing of information inside the network, a single corrupted packet generated by a mali...
Sidharth Jaggi, Michael Langberg, Sachin Katti, Tr...