The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Separating agreement from execution for byzantine fault tolerant services
Abstract
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests. This separation yields two fundamental and practically significant advantages over previous architectures. First, it reduces replication costs because the new architecture can tolerate faults in up to half of the state machine replicas that execute requests. Previous systems can tolerate faults in at most a third of the combined agreement/state machine replicas. Second, separating agreement from execution allows a general privacy firewall architecture to protect confidentiality through replication. In contrast, replication in previous systems hurts confidentiality because exploiting the weakest replica can be sufficient to compromise the system. We have constructed a prototype and evaluated it running both microbenchmarks and an NFS server. Overall, we find that the architecture adds modest latencies to unreplicated systems and that its performance is competitive with existing Byzantine fault tolerant systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Untraceable electronic mail, return addresses, and digital pseudonyms
Chaum, D. L. (1981) · Communications of the ACM · doi:10.1145/358549.358563 · Cited by 4,289
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
Burrows, M., Abadi, M., & Needham, R. (1990) · ACM Transactions on Computer Systems · doi:10.1145/77648.77649 · Cited by 2,523
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
A Randomized Protocol for Signing Contracts
Even, S., Goldreich, O., & Lempel, A. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_19 · Cited by 1,450
Scale and performance in a distributed file system
Howard, J. H., Kazar, M. L., Menees, S. G., Nichols, D. A., Satyanarayanan, M., Sidebotham, R. N., & West, M. J. (1988) · ACM Transactions on Computer Systems · doi:10.1145/35037.35059 · Cited by 1,403
Lamport, L. (2001) · Cited by 1,325
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379239 · Cited by 869
SEDA: an architecture for well-conditioned, scalable internet services
Welsh, M., Culler, D., & Brewer, E. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502057 · Cited by 834
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844130 · Cited by 780
An experimental evaluation of the assumption of independence in multiversion programming
Knight, J. C., & Leveson, N. G. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312924 · Cited by 774
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_27 · Cited by 738
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
Asynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
Data diversity: an approach to software fault tolerance
Ammann, P., & KNIGHT, J. C. (1988) · IEEE Transactions on Computers · doi:10.1109/12.2185 · Cited by 412
Statistical identification of encrypted Web browsing traffic
Sun, Q., Simon, D. R., Wang, Y.-M., Russell, W., Padmanabhan, V. N., & Qiu, L. (2005) · Proceedings 2002 IEEE Symposium on Security and Privacy · doi:10.1109/secpri.2002.1004359 · Cited by 377
CMC: a pragmatic approach to model checking real code
Musuvathi, M., Park, D. Y. W., Chou, A., Engler, D. R., & Dill, D. L. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844136 · Cited by 361
Separating key management from file system security
Mazières, D., Kaminsky, M., Kaashoek, M. F., & Witchel, E. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319160 · Cited by 332
COCA: A secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571638 · Cited by 278
Replication in the harp file system
Liskov, B., Ghemawat, S., Gruber, R., Johnson, P., Shrira, L., & Williams, M. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121169 · Cited by 273
COCA: A Secure Distributed On-line Certification Authority
Zhou, L., Schneider, F. B., & van Renesse, R. (2002) · eCommons (Cornell University) · Cited by 257
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
Bellare, M., & Micciancio, D. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_13 · Cited by 250
Fast implementations of RSA cryptography
Shand, M., & Vuillemin, J. (2002) · Proceedings of IEEE 11th Symposium on Computer Arithmetic · doi:10.1109/arith.1993.378085 · Cited by 221
Message authentication with one-way hash functions
Tsudik, G. (1992) · ACM SIGCOMM Computer Communication Review · doi:10.1145/141809.141812 · Cited by 182
The Rampart toolkit for building high-integrity services
Reiter, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_7 · Cited by 174
Proactive recovery in a Byzantine-fault-tolerant system
Castro, M., & Liskov, B. H. (2000) · doi:10.5555/1251229.1251248 · Cited by 174
The SecureRing protocols for securing group communication
Kihlstrom, K. P., Moser, L. E., & Melliar-Smith, P. M. (2002) · Proceedings of the Thirty-First Hawaii International Conference on System Sciences · doi:10.1109/hicss.1998.656294 · Cited by 171
BASE: using abstraction to improve fault tolerance
Rodrigues, R., Castro, M., & Liskov, B. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502037 · Cited by 166
BASE: Using abstraction to improve fault tolerance
Castro, M., Rodrigues, R., & Liskov, B. H. (2003) · ACM Transactions on Computer Systems · doi:10.1145/859716.859718 · Cited by 163
COCA: a secure distributed online certification authority
Zhou, L., Schneider, F. B., & Van Renesse, R. (2004) · Foundations of Intrusion Tolerant Systems, 2003 [Organically Assured and Survivable Information Systems] · doi:10.1109/fits.2003.1264932 · Cited by 163
A general theory of composition for a class of "possibilistic" properties
McLean, J. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481534 · Cited by 157
Using abstraction to improve fault tolerance
Castro, M., Rodrigues, R., & Liskov, B. H. (2005) · Workshop on Hot Topics in Operating Systems · doi:10.1109/hotos.2001.990057 · Cited by 150
Fully Polynomial Byzantine Agreement for n > 3 t Processors in t + 1 Rounds
Garay, J. A., & Moses, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794265232 · Cited by 138
Secure distributed storage and retrieval
Garay, J. A., Gennaro, R., Jutla, C. S., & Rabin, T. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00263-1 · Cited by 97
The Echo Distributed File System
Birrell, A. D., Hisgen, A., Jerian, C., Mann, T., & Swart, G. (1993) · Cited by 75
Cited by
The Chubby lock service for loosely-coupled distributed systems
Burrows, M. (2006) · Operating Systems Design and Implementation · doi:10.5555/1298455.1298487 · Cited by 877
Zyzzyva: speculative byzantine fault tolerance
Kotla, R., Alvisi, L., Dahlin, M., Clement, A., & Wong, E. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294267 · Cited by 638
Self-citationA Vademecum on Blockchain Technologies: When, Which, and How
Belotti, M., Bozic, N., Pujolle, G., & Secci, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2928178 · Cited by 498
SBFT: A Scalable and Decentralized Trust Infrastructure
Golan Gueta, G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2019) · 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) · doi:10.1109/dsn.2019.00063 · Cited by 362
PeerReview: practical accountability for distributed systems
Haeberlen, A., Kouznetsov, P., & Druschel, P. (2007) · Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles · doi:10.1145/1294261.1294279 · Cited by 337
Metadata
- Authors
- Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2003-10-19
- Volume
- 37
- Issue
- 5
- Pages
- 253-267
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2126789306
- Cited by
- 309
- References
- 45
- FWCI
- 16.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.