A randomized protocol for signing contracts
Communications of the ACM
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Wait-free implementations in message-passing systems
Theoretical Computer Science
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Simplifying fault-tolerance: providing the abstraction of crash failures
Journal of the ACM (JACM)
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Coin flipping by telephone a protocol for solving impossible problems
ACM SIGACT News - A special issue on cryptography
Concurrent Non-Malleable Commitments
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Symmetry breaking in distributive networks
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
In this paper we consider the fundamental problems of renaming and order-preserving renaming [1] in a synchronous message passing system with Byzantine failures. We study the feasibility of solving these problems using randomized algorithms under both non-rushing and rushing adversaries. We first show that there is a randomized algorithm that solves renaming efficiently for any t N under the non-rushing adversary (N is the number of processes, and t is the maximum number of Byzantine processes). This result establishes a separation between randomized and deterministic renaming, since it is known that there are no efficient deterministic algorithms for t≥N/3. Our algorithm terminates in O(log N) rounds w.h.p. We next consider the renaming problem in the harder setting with the rushing adversary. Interestingly, we show that in this setting the algorithm also works with t = 1 but fails for larger t. We then give an algorithm that works with any t N by relying on cryptographic commitment. Finally, we turn our attention to the problem of order-preserving renaming, which requires the new names to preserve the order of the initial identifiers. For this problem, we prove a tight t N/3 bound that holds for both deterministic and randomized algorithms.