• Aucun résultat trouvé

[PDF] Top 20 Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes

Has 10000 "Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes" found on our website. Below are the top 20 most common "Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes".

Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes

Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes

... Byzantine consensus algorithm based on UB-broadcast requires t < n/5, while its instance based on ND- broadcast requires t < ...Finally, the Byzantine consensus algorithm based ... Voir le document complet

25

Communication and Agreement Abstractions in the Presence of Byzantine Processes

Communication and Agreement Abstractions in the Presence of Byzantine Processes

... up of n processes, and where up to t processes may com- mit Byzantine failures, the aim of the paper was to present in a simple and homogeneous way ... Voir le document complet

25

Modular randomized byzantine k-set agreement in asynchronous message-passing systems

Modular randomized byzantine k-set agreement in asynchronous message-passing systems

... a broadcast abstraction which guaran- tees that two non-faulty processes cannot receive distinct messages from the same (possibly Byzantine) sender, and (ii) the stacking ... Voir le document complet

18

Boosting the Efficiency of Byzantine-tolerant Reliable Communication

Boosting the Efficiency of Byzantine-tolerant Reliable Communication

... proposed in the literature to build Byzantine-tolerant reliable communication ...(i) processes interconnected through a possibly multi-hop communication network (ii) and an upper ... Voir le document complet

19

Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems

Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems

... third of processes may be faulty. 2.2 Reliable Broadcast Abstraction This section presents a reliable broadcast abstraction (denoted r-broadcast), that will be used to build atomic ... Voir le document complet

19

Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value

Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value

... family of consensus algorithms in which no bad value is ever decided by correct ...These processes always decide a value they have proposed (and this is always the case when they all ... Voir le document complet

16

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

... Abstract: In self-organizing systems, such as mobile ad-hoc and peer-to-peer networks, consensus is a fundamental building block to solve agreement ...actions of nodes distributed in an ... Voir le document complet

33

Multi-hop Byzantine Reliable Broadcast with Honest Dealer Made Practical

Multi-hop Byzantine Reliable Broadcast with Honest Dealer Made Practical

... problems and, considering the Menger theorem in Remark 2, one may conclude that there is no tangible reason to prefer one among VC and ...matter of fact, the equivalence between ... Voir le document complet

40

Optimal Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp

Optimal Self-Stabilizing Mobile Byzantine-Tolerant Regular Register with bounded timestamp

... set of processes, ...read() and write(). Informally, the write() operation up- dates the value stored in the shared variable while the read() obtains the ... Voir le document complet

33

Synchronous byzantine agreement with nearly a cubic number of communication bits

Synchronous byzantine agreement with nearly a cubic number of communication bits

... non-Byzantine processes is close by factor O(n log n) to the lower bound Ω(n 2 ) on the total number of communication ...bits. In order to achieve this, the ... Voir le document complet

16

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

... Networks of static and/or mobile sensors (that is, robots) [17] received increas- ing attention in the past few years from the Distributed Computing ...On the one hand, ... Voir le document complet

18

UTXOs as a proof of membership for Byzantine Agreement based Cryptocurrencies

UTXOs as a proof of membership for Byzantine Agreement based Cryptocurrencies

... subset of the nodes involved in the proof-of-work ...competition. The incentive to participate to such a competition is provided by a reward given to each successful ...made ... Voir le document complet

9

Byzantine-tolerant Uniform Node Sampling Service in Large-scale Networks

Byzantine-tolerant Uniform Node Sampling Service in Large-scale Networks

... graph. In the following we suppose that T 0 = ...Service tolerant to Malicious Nodes As mentioned in the introduction, a sampling service is a functionality local to each (correct) 1 ... Voir le document complet

33

Case, agreement and word order : issues in the syntax and acquisition of Taml

Case, agreement and word order : issues in the syntax and acquisition of Taml

... With respect to the TP-internal structure, the case and agreement properties in the syntax of Tamil are indicated in a wide variety of constructions, including finite (nominative an[r] ... Voir le document complet

146

Decentralizing UNIX abstractions in the exokernel architecture

Decentralizing UNIX abstractions in the exokernel architecture

... To decentralize OS abstractions many problems must be addressed: state that was previously persistent across process invocations may no longer be; shared state can [r] ... Voir le document complet

51

Argument licensing and agreement in Zulu

Argument licensing and agreement in Zulu

... While Zulu is a language that has rich person, number, and noun class agreement in the subject and object agreement paradigms, neither the conjoint/disjoint altern[r] ... Voir le document complet

307

Anchoring and Agreement in Syntactic Annotations

Anchoring and Agreement in Syntactic Annotations

... tasks in NLP, POS tagging and dependency parsing. In the POS tagging task, each word in a sentence has to be cate- gorized with a Penn Treebank POS tag (Santorini, 1990) (henceforth ... Voir le document complet

11

The Silk and the Blood. Images of Authority in Byzantine Art and Archaeology (Bologna, February 15th, 2019). Inauguration of the digital exhibition and proceedings of the final meeting of “Byzart - Byzantine Art and Archaeology on Europeana” project

The Silk and the Blood. Images of Authority in Byzantine Art and Archaeology (Bologna, February 15th, 2019). Inauguration of the digital exhibition and proceedings of the final meeting of “Byzart - Byzantine Art and Archaeology on Europeana” project

... created and held by academic institutions and museums comprise more than ...from the most eminent centers of Byzan- tine culture and also from several lesser known Byzantine ... Voir le document complet

179

The Opinion Number of Set-Agreement

The Opinion Number of Set-Agreement

... CNRS and U. of Bordeaux, France ...on the effort to bridging runtime verification with distributed computabil- ity, studying necessary conditions for monitoring failure prone asynchronous distributed ... Voir le document complet

19

Assessing Software Abstractions in WCET Analysis of Reactive Programs

Assessing Software Abstractions in WCET Analysis of Reactive Programs

... Abstract The estimation of the worst case execution time (WCET) of a reactive system on a given architecture is an important goal for time-critical ...because of the complexity ... Voir le document complet

24

Show all 10000 documents...