Search Results - "Dolev, Danny"

Compact routing messages in self-healing trees by Castañeda, Armando, Dolev, Danny, Trehan, Amitabh

“…Existing compact routing schemes, e.g., Thorup and Zwick [4] and Chechik [6] often have no means to tolerate failures, once the system has been set up and…”
Get full text

Enhanced calibration technique for RSSI-based ranging in body area networks by Blumrosen, Gaddi, Hod, Bracha, Anker, Tal, Dolev, Danny, Rubinsky, Boris

“…Indoor positioning systems based on Received Signal Strength Indicator (RSSI) in Wireless Sensor Networks (WSNs) are commonly used. The position accuracy in…”
Get full text

Revisiting asynchronous fault tolerant computation with optimal resilience by Abraham, Ittai, Dolev, Danny, Stern, Gilad

“…The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient…”
Get full text

Communication complexity of byzantine agreement, revisited by Abraham, Ittai, Chan, T.-H. Hubert, Dolev, Danny, Nayak, Kartik, Pass, Rafael, Ren, Ling, Shi, Elaine

“…As Byzantine Agreement (BA) protocols find application in large-scale decentralized cryptocurrencies, an increasingly important problem is to design BA…”
Get full text

Synchronous counting and computational algorithm design by Dolev, Danny, Heljanko, Keijo, Järvisalo, Matti, Korhonen, Janne H., Lenzen, Christoph, Rybicki, Joel, Suomela, Jukka, Wieringa, Siert

“…Consider a complete communication network on n nodes. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses…”
Get full text

Fault Identification Via Nonparametric Belief Propagation by Bickson, Danny, Baron, Dror, Ihler, Alexander, Avissar, Harel, Dolev, Danny

“…We consider the problem of identifying a pattern of faults from a set of noisy linear measurements. Unfortunately, maximum a posteriori (MAP) probability…”
Get full text

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip by Dolev, Danny, Függer, Matthias, Posch, Markus, Schmid, Ulrich, Steininger, Andreas, Lenzen, Christoph

“…We present the first implementation of a distributed clock generation scheme for Systems-on-Chip that recovers from an unbounded number of arbitrary transient…”
Get full text

Asynchronous resource discovery by Abraham, Ittai, Dolev, Danny

“…Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer-to-peer system) can communicate only with nodes…”
Get full text

HEX: Scaling honeycombs is easier than scaling clock trees by Dolev, Danny, Függer, Matthias, Lenzen, Christoph, Perner, Martin, Schmid, Ulrich

“…We argue that a hexagonal grid with simple intermediate nodes is a robust alternative to buffered clock trees typically used for clock distribution in VLSI…”
Get full text

Internet resiliency to attacks and failures under BGP policy routing by Dolev, Danny, Jamin, Sugih, Mokryn, Osnat (Ossi), Shavitt, Yuval

“…We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements…”
Get full text

Asynchronous resource discovery : Algorithms for distributed systems by ABRAHAM, Ittai, DOLEV, Danny

Get full text

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks by Amir, Y., Danilov, C., Dolev, D., Kirsch, J., Lane, J., Nita-Rotaru, C., Olsen, J., Zage, D.

“…This paper presents the first hierarchical byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The…”
Get full text

On multicast trees by Dolev, Danny, Mokryn, Osnat, Shavitt, Yuval

“…This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated…”
Get full text

Colordag: An Incentive-Compatible Blockchain by Abraham, Ittai, Dolev, Danny, Eyal, Ittay, Halpern, Joseph Y

“…We present Colordag, a blockchain protocol where following the prescribed strategy is, with high probability, a best response as long as all miners have less…”
Get full text

Peer-to-peer secure multi-party numerical computation facing malicious adversaries by Bickson, Danny, Reinman, Tzachy, Dolev, Danny, Pinkas, Benny

“…We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of…”
Get full text

Nonmalleable Cryptography by Dolev, Danny, Dwork, Cynthia, Naor, Moni

“…The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional…”
Get full text

Live Distributed Objects: Enabling the Active Web by Ostrowski, K., Birman, K., Dolev, D.

“…Distributed computing has lagged behind the productivity revolution that has transformed the desktop in recent years. Programmers still generally treat the Web…”
Get full text

Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience by Abraham, Ittai, Dolev, Danny, Stern, Gilad

“…The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient…”
Get full text

Possibility and Impossibility of Reliable Broadcast in the Bounded Model by Dolev, Danny, Spielrien, Meir

“…The Reliable Broadcast concept allows an honest party to send a message to all other parties and to make sure that all honest parties receive this message. In…”
Get full text

Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset by Dolev, Danny, Gafni, Eli

“…Are there Byzantine Animals? A Fooling Behavior is exhibited by the Cuckoo bird. It sneakily replaces some of the eggs of other species with its own. Lest the…”
Get full text