Filters








251 Hits in 6.4 sec

Byzantine-Tolerant Register in a System with Continuous Churn [article]

Saptaparni Kumar, Jennifer L. Welch
2019 arXiv   pre-print
A shared read/write register emulation provides the illusion of shared-memory on top of message-passing models. The main hurdle with such emulations is dealing with server faults in the system.  ...  This paper presents the first emulation of a multi-reader multi-writer atomic register in a system that can withstand nodes continually entering and leaving, imposes no upper bound on the system size and  ...  Challenges with Byzantine Servers Our algorithm is called ABCC register, for Atomic Byzantine-tolerant Continuous Churn.  ... 
arXiv:1910.06716v1 fatcat:vgbazgzs5rbypg4toumgh2meoe

An Algorithm for Implementing BFT Registers in Distributed Systems with Bounded Churn [chapter]

Roberto Baldoni, Silvia Bonomi, Amir Soltani Nezhad
2011 Lecture Notes in Computer Science  
In this paper, we address the problem of building of a safe register storage resilient to byzantine failures in a distributed system affected from churn.  ...  A protocol implementing a safe register in an eventually synchronous system is proposed and some feasibility constraints on the arrival and departure of the processes are given.  ...  In the prior works, we studied the same problem from a structural point of view [7] and in an environment with crash failures [6] . Byzantine fault tolerant systems based on quorums.  ... 
doi:10.1007/978-3-642-24550-3_5 fatcat:ogb2vhowsvaspeo4ruudttqa7q

Multi-writer regular registers in dynamic distributed systems with byzantine failures

Silvia Bonomi, Amir Soltani Nezhad
2011 Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems - TADDS '11  
In this paper, we address the problem of building of a multi-writer/ multireader regular register storage resilient to byzantine failures in a distributed system affected from churn.  ...  A protocol implementing such a register in a synchronous system is proposed and some feasibility constraints on the arrival and departure of processes are given.  ...  Byzantine fault tolerant systems based on quorums.  ... 
doi:10.1145/2034640.2034644 dblp:conf/tadds/BonomiN11 fatcat:j6jb2r44pvbixo4b635z5ujpru

DataCube: A P2P Persistent Data Storage Architecture Based on Hybrid Redundancy Schema

Heverson B. Ribeiro, Emmanuelle Anceaume
2010 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing  
This is a fundamental and required assumption to be able to design Byzantine tolerant algorithms [9]).  ...  However, in contrast to classic distributed systems in which the membership is stable, in peer-to-peer systems one has to face nodes churn (nodes propensity to frequently join and leave the system).  ...  Note that if the number of B neighbours is not sufficient to invoke a Byzantine tolerant agreement, then C relies on the closest cluster A to B to decide on B corruption.  ... 
doi:10.1109/pdp.2010.60 dblp:conf/pdp/RibeiroA10 fatcat:nijfequicfaazdnmo2bokigkgu

Exploiting Rateless Coding in Structured Overlays to Achieve Data Persistence

H.B. Ribeiro, E. Anceaume
2010 2010 24th IEEE International Conference on Advanced Information Networking and Applications  
In this paper we evaluate the performance of DataCube a P2P persistent data storage platform.  ...  This platform exploits the properties of cluster-based peer-to-peer structured overlays together with a hybrid redundancy schema (a compound of light replication and rateless erasure coding) to guarantee  ...  , and to efficiently tolerate malicious peers by running Byzantine-tolerant agreement protocols among clusters nodes.  ... 
doi:10.1109/aina.2010.61 dblp:conf/aina/RibeiroA10 fatcat:qvhppgsrxvah3nserwbhf6kpme

DEPENDABILITY EVALUATION OF CLUSTER-BASED DISTRIBUTED SYSTEMS

EMMANUELLE ANCEAUME, FRANCISCO BRASILEIRO, ROMARIC LUDINARD, BRUNO SERICOLA, FRÉDÉRIC TRONEL
2011 International Journal of Foundations of Computer Science  
from the initial amount of corruption in the system.  ...  We then show that when all nodes (honest and malicious ones) are imposed on a limited lifetime, the system eventually reaches a stationary regime where the ratio of polluted clusters is bounded, independently  ...  Finally, we have shown that this induced churn is fully compatible with the natural churn observed in peer-to-peer systems, which makes our approach definitively adapted to large scale and open systems  ... 
doi:10.1142/s0129054111008593 fatcat:xrxekvtnirbbxpp7l6iagbz3r4

Simulating a Shared Register in an Asynchronous System that Never Stops Changing [chapter]

Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch
2015 Lecture Notes in Computer Science  
The simulation replicates the value of the register in multiple servers and requires readers and writers to communicate with a majority of servers.  ...  This paper presents the first simulation of an atomic read/write register in a crashprone asynchronous system that can change size and withstand nodes continually entering and leaving.  ...  Our algorithm, called CCREG (for Continuous Churn Register), combines the simple static algorithm for multiple readers and multiple writers outlined above with a joining protocol and careful estimations  ... 
doi:10.1007/978-3-662-48653-5_6 fatcat:2qtzk5tdwbeapa27opi43ai6ea

Exploiting Temporal Dynamics in Sybil Defenses

Changchang Liu, Peng Gao, Matthew Wright, Prateek Mittal
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
Sybil attacks present a significant threat to many Internet systems and applications, in which a single adversary inserts multiple colluding identities in the system to compromise its security and privacy  ...  However, most of the prior security analyses of such systems examine only the case of social networks at a single instant in time.  ...  This work was supported in part by NSF awards number CNS-1423139, CNS-1409415, CNS-1423163 and CNS-0954133.  ... 
doi:10.1145/2810103.2813693 dblp:conf/ccs/LiuGWM15 fatcat:npyijkehtbcdzhfykeintev42u

Handling bitcoin conflicts through a glimpse of structure

Thibaut Lajoie-Mazenc, Romaric Ludinard, Emmanuelle Anceaume
2017 Proceedings of the Symposium on Applied Computing - SAC '17  
Byzantine-tolerant consensus protocols.  ...  In PeerCensus it is implemented by relying on Byzantine Fault Tolerant consensus protocols (e.g. [8, 14, 19] ) run by all the miners that successfully generated a block.  ... 
doi:10.1145/3019612.3019657 dblp:conf/sac/Lajoie-MazencLA17 fatcat:kyodkg3v2vbglgrmetsrslckbu

Optimizing Data Management in Grid Environments [chapter]

Antonis Zissimos, Katerina Doka, Antony Chazapis, Dimitrios Tsoumakos, Nectarios Koziris
2009 Lecture Notes in Computer Science  
On one hand, DRLS ensures resilience by relying on a Byzantine-tolerant protocol and is able to handle massive concurrent requests even during node churn.  ...  The proposed integrated architecture is completely backwards-compatible with already deployed Grids.  ...  We continue our experiments by testing GridTorrent's tolerance in an errorprone network.  ... 
doi:10.1007/978-3-642-05148-7_38 fatcat:edmxzsyfgzcjhn6422tky635hm

Security and privacy issues in P2P streaming systems: A survey

Gabriela Gheorghe, Renato Lo Cigno, Alberto Montresor
2010 Peer-to-Peer Networking and Applications  
; and (ii) the general perception (not necessarily the truth, but a commonplace belief) that it is necessary to sacrifice accuracy or performance in order to tolerate faults or misbehaviors, is not always  ...  Starting from existing analyses and security models in the related literature, we give an overview on security and privacy considerations for P2P streaming systems.  ...  The purpose of the P2P overlay network is double: tolerate Byzantine nodes and selfstabilize (to adapt dynamically to churn).  ... 
doi:10.1007/s12083-010-0070-6 fatcat:hgg7fujecbdvpd7647lttvh2qm

A survey of DHT security techniques

Guido Urdaneta, Guillaume Pierre, Maarten Van Steen
2011 ACM Computing Surveys  
To the best of our knowledge, this is the first study in security for DHT-based systems that provides such a comprehensive overview.  ...  OVERVIEW OF DHTS DHTs are distributed systems composed of many nodes that implement the operation lookup(k), which returns data associated with a key k.  ...  The first one consists of an emulation of a walk in the continuous graph towards a node that covers the requested item. It can tolerate random fail-stop failures, but not Byzantine behavior.  ... 
doi:10.1145/1883612.1883615 fatcat:7pirixlgcnf73j4qpccs6mr6gu

Virtual Tree: A robust architecture for interval valid queries in dynamic distributed systems

Roberto Baldoni, Silvia Bonomi, Adriano Cerocchi, Leonardo Querzoni
2013 Journal of Parallel and Distributed Computing  
This paper studies the problem of answering aggregation queries, satisfying the interval validity semantics, in a distributed system prone to continuous arrival and departure of participants.  ...  We formally prove a bound on the churn rate for interval valid queries in a distributed system where communication latencies are bounded by a constant unknown by processes.  ...  PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn. In Proceedings of the 2nd IEEE International Conference on Self-  ... 
doi:10.1016/j.jpdc.2013.03.017 fatcat:mulruc3s65adzodwwzni4ez27a

Proof of Work Without All the Work: Computationally Efficient Attack-Resistant Systems [article]

Diksha Gupta, Jared Saia, Maxwell Young
2018 arXiv   pre-print
Our results hold in a dynamic, decentralized system where participants join and depart over time, and where the total computational power of the attacker is up to a constant fraction of the total computational  ...  In particular, the fraction of identities in the system that are controlled by an attacker is always less than 1/2.  ...  The committee runs a Byzantine Fault Tolerant (BFT) protocol on the transactions to generate a daily log, which is logged in the blockchain.  ... 
arXiv:1708.01285v3 fatcat:6etboypwqfcx3mk4mu7rmczroi

SecureStream: An intrusion-tolerant protocol for live-streaming dissemination

Maya Haridasan, Robbert van Renesse
2008 Computer Communications  
We explore this in SecureStream, a P2P live-streaming system built to tolerate malicious behavior at the end level.  ...  This and other techniques allow our system to be tolerant to a variety of intrusions, gracefully degrading even in the presence of a large percentage of malicious peers.  ...  Our results indicate that SecureStream tolerates a limited percentage of malicious nodes in the system, and that with the aid of an auditing component, it is able to provide satisfactory quality in the  ... 
doi:10.1016/j.comcom.2007.08.028 fatcat:bk7gjgddiragdpazxm3brgi5sa
« Previous Showing results 1 — 15 out of 251 results