| On the security of public key protocols D Dolev, A Yao IEEE Transactions on information theory 29 (2), 198-208, 1983 | 7285 | 1983 |
| Non-malleable cryptography D Dolev, C Dwork, M Naor Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 2025 | 1991 |
| On the minimal synchronism needed for distributed consensus D Dolev, C Dwork, L Stockmeyer Journal of the ACM (JACM) 34 (1), 77-97, 1987 | 972 | 1987 |
| Atomic broadcast: From simple message diffusion to Byzantine agreement F Cristian, H Aghili, R Strong, D Dolev Information and Computation 118 (1), 158-179, 1995 | 852 | 1995 |
| Authenticated algorithms for Byzantine agreement D Dolev, HR Strong SIAM Journal on Computing 12 (4), 656-666, 1983 | 802 | 1983 |
| The Byzantine generals strike again D Dolev Journal of algorithms 3 (1), 14-30, 1982 | 769 | 1982 |
| Sharing memory robustly in message-passing systems H Attiya, A Bar-Noy, D Dolev Journal of the ACM (JACM) 42 (1), 124-142, 1995 | 719 | 1995 |
| Atomic snapshots of shared memory Y Afek, H Attiya, D Dolev, E Gafni, M Merritt, N Shavit Journal of the ACM (JACM) 40 (4), 873-890, 1993 | 719 | 1993 |
| Transis: A communication sub-system for high availability Y Amir, D Dolev, S Kramer, D Malki Hebrew University of Jerusalem. Leibniz Center for Research in Computer …, 1991 | 677 | 1991 |
| Reaching approximate agreement in the presence of faults D Dolev, NA Lynch, SS Pinter, EW Stark, WE Weihl Journal of the ACM (JACM) 33 (3), 499-516, 1986 | 665 | 1986 |
| Perfectly secure message transmission D Dolev, C Dwork, O Waarts, M Yung Journal of the ACM (JACM) 40 (1), 17-47, 1993 | 553 | 1993 |
| The Transis approach to high availability cluster communication D Dolev, D Malki Communications of the ACM 39 (4), 64-70, 1996 | 522 | 1996 |
| Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation I Abraham, D Dolev, R Gonen, J Halpern Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006 | 484 | 2006 |
| Renaming in an asynchronous environment H Attiya, A Bar-Noy, D Dolev, D Peleg, R Reischuk Journal of the ACM (JACM) 37 (3), 524-548, 1990 | 385 | 1990 |
| Bounds on information exchange for Byzantine agreement D Dolev, R Reischuk Journal of the ACM (JACM) 32 (1), 191-204, 1985 | 351 | 1985 |
| An O (n log n) unidirectional distributed algorithm for extrema finding in a circle D Dolev, M Klawe, M Rodeh Journal of algorithms 3 (3), 245-260, 1982 | 332 | 1982 |
| Early stopping in Byzantine agreement D Dolev, R Reischuk, HR Strong Journal of the ACM (JACM) 37 (4), 720-741, 1990 | 330 | 1990 |
| On the possibility and impossibility of achieving clock synchronization D Dolev, J Halpern, HR Strong Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984 | 309 | 1984 |
| Fault-tolerant clock synchronization JY Halpern, B Simons, R Strong, D Dolev Proceedings of the third annual ACM symposium on Principles of distributed …, 1984 | 250 | 1984 |
| Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement A Bar-Noy, D Dolev, C Dwork, HR Strong Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed …, 1987 | 217 | 1987 |
