research-article

Public Access

Basil: Breaking up BFT with ACID (transactions)

Authors:

Florian Suri-Payer,

Lorenzo Alvisi,

Natacha CrooksAuthors Info & Claims

SOSP '21: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles

Pages 1 - 17

https://doi.org/10.1145/3477132.3483552

Published: 26 October 2021 Publication History

Abstract

This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-value store. Basil leverages ACID transactions to scalably implement the abstraction of a trusted shared log in the presence of Byzantine actors. Unlike traditional BFT approaches, Basil executes non-conflicting operations in parallel and commits transactions in a single round-trip during fault-free executions. Basil improves throughput over traditional BFT systems by four to five times, and is only four times slower than TAPIR, a non-Byzantine replicated system. Basil's novel recovery mechanism further minimizes the impact of failures: with 30% Byzantine clients, throughput drops by less than 25% in the worst-case.

References

[1]

Byzantine fault-tolerant (bft) state machine replication (smart) v1.2. https://github.com/bft-smart/library.

[2]

CloudLab. https://www.cloudlab.us.

[3]

Retwis benchmark. http://retwis.redis.io/.

[4]

State Farm and USAA Work Together to Test a Blockchain Solution. https://newsroom.statefarm.com/blockchain-solution-test-for-subrogation/, 2019.

[5]

IBM food trust. A new era for the world's food supply. https://www.ibm.com/blockchain/solutions/food-trust, 2020.

[6]

JP Morgan Quorum. https://www.goquorum.com/, 2020.

[7]

M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Fault-scalable Byzantine fault-tolerant services. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 59--74, 2005.

Digital Library

[8]

M. K. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: A new paradigm for building scalable distributed systems. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 159--174, 2007.

Digital Library

[9]

M. Al-Bassam, A. Sonnino, S. Bano, D. Hrycyszyn, and G. Danezis. Chainspace: A sharded smart contracts platform. arXiv:1708.03778, 2017.

[10]

E. Androulaki, A. Barger, V. Bortnikov, C. Cachin, K. Christidis, A. De Caro, D. Enyeart, C. Ferris, G. Laventman, Y. Manevich, et al. Hyperledger Fabric: a distributed operating system for permissioned blockchains. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 1--15, 2018.

[11]

J. Ansel and M. Olszewski. Bftree - scaling hotstuff to millions of validators. https://storage.googleapis.com/celo_whitepapers/BFTree%20-%20Scaling%20HotStuff%20to%20Millions%20of%20Validators.pdf, 2019.

[12]

B. Arun, S. Peluso, and B. Ravindran. ezbft: Decentralizing Byzantine fault-tolerant state machine replication. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), pages 565--577, 2019.

[13]

M. Baudet, A. Ching, A. Chursin, G. Danezis, F. Garillot, Z. Li, D. Malkhi, O. Naor, D. Perelman, and A. Sonnino. State machine replication in the libra blockchain. The Libra Association Technical Report, 2019.

[14]

R. Bazzi and M. Herlihy. Clairvoyant state machine replications. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pages 254--268. Springer, 2018.

[15]

D. Bernstein, N. Duif, T. Lange, P. Schwabe, and B.-Y. Yang. Ed25519: high-speed high-security signatures. http://ed25519.cr.yp.to/.

[16]

P. A. Bernstein and N. Goodman. Multiversion concurrency control-theory and algorithms. ACM Transactions on Database Systems (TODS), 8(4):465--483, 1983.

[17]

P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems, volume 370. Addison-wesley New York, 1987.

Digital Library

[18]

P. A. Bernstein, D. W. Shipman, and W. S. Wong. Formal aspects of serializability in database concurrency control. IEEE Transactions on Software Engineering, 5(3):203--216, May 1979.

Digital Library

[19]

A. Bessani, J. Sousa, and E. E. Alchieri. State machine replication for the masses with BFT-SMaRt. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), pages 355--362, 2014.

Digital Library

[20]

A. Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme. In International Workshop on Public Key Cryptography, pages 31--46. Springer, 2003.

Digital Library

[21]

D. Boneh, M. Drijvers, and G. Neven. Compact multi-signatures for smaller blockchains. In International Conference on the Theory and Application of Cryptology and Information Security, pages 435--464. Springer, 2018.

Digital Library

[22]

D. Boneh, C. Gentry, B. Lynn, and H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In International conference on the theory and applications of cryptographic techniques, pages 416--432. Springer, 2003.

Digital Library

[23]

E. Buchman. Tendermint: Byzantine fault tolerance in the age of blockchains. PhD thesis, 2016.

[24]

C. Cachin, K. Kursawe, and V. Shoup. Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography. Journal of Cryptology, 18(3):219--246, 2005.

Digital Library

[25]

M. Castro, B. Liskov, et al. Practical Byzantine fault tolerance. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 173--186, 1999.

[26]

T.-H. H. Chan, R. Pass, and E. Shi. Pala: A simple partially synchronous blockchain. IACR Cryptol. ePrint Arch., 2018:981, 2018.

[27]

T. Chandra, R. Griesmer, and J. Redstone. Paxos made live - an engineering perspective. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 398--407, 2007.

[28]

A. Clement, M. Kapritsos, S. Lee, Y. Wang, L. Alvisi, M. Dahlin, and T. Riche. Upright cluster services. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 277--290, 2009.

Digital Library

[29]

A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making Byzantine fault tolerant systems tolerate Byzantine faults. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), page 153--168, 2009.

[30]

B. F. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears. Benchmarking cloud serving systems with YCSB. In Proceedings of the ACM Symposium on Cloud Computing (SOCC), pages 143--154, 2010.

Digital Library

[31]

J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, W. Hsieh, S. Kanthak, E. Kogan, H. Li, A. Lloyd, S. Melnik, D. Mwaura, D. Nagle, S. Quinlan, R. Rao, L. Rolig, Y. Saito, M. Szymaniak, C. Taylor, R. Wang, and D. Woodford. Spanner: Google's globally-distributed database. In Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, OSDI '12, pages 251--264.

Digital Library

[32]

J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 177--190, 2006.

[33]

N. Crooks, M. Burke, E. Cecchetti, S. Harel, R. Agarwal, and L. Alvisi. Obladi: Oblivious serializable transactions in the cloud. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pages 727--743, Carlsbad, CA, Oct. 2018. USENIX Association.

[34]

Cypherium.io. Cypherium-whitepaper-2-0. https://www.cypherium.io/whitepaper/cypherium-whitepaper-2-0/.

[35]

Deloitte. Using blockchain & internet-of-things in supply chain traceability. https://www2.deloitte.com/content/dam/Deloitte/lu/Documents/technology/lu-blockchain-internet-things-supply-chain-traceability.pdf, 2017.

[36]

Diem. To build a trusted and innovative financial network that empowers people and businesses around the world. https://www.diem.com/en-us/, 2021.

[37]

D. E. Difallah, A. Pavlo, C. Curino, and P. Cudre-Mauroux. OLTP-Bench: An extensible testbed for benchmarking relational databases. In Proceedings of the VLDB Endowment (PVLDB), 2013.

Digital Library

[38]

S. Duan, S. Peisert, and K. N. Levitt. hBFT: speculative Byzantine fault tolerance with minimum cost. IEEE Transactions on Dependable and Secure Computing, 12(1):58--70, 2014.

Digital Library

[39]

C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM (JACM), 35(2):288--323, 1988.

[40]

M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985.

[41]

M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM (JACM), 32(2):374--382, 1985.

[42]

floodyberry. ed25519-donna. https://github.com/floodyberry/ed25519-donna.

[43]

R. Garcia, R. Rodrigues, and N. Preguiça. Efficient middleware for Byzantine fault tolerant database replication. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 107--122, 2011.

Digital Library

[44]

C. Gentry and Z. Ramzan. Identity-based aggregate signatures. In International workshop on public key cryptography, pages 257--273. Springer, 2006.

Digital Library

[45]

Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich. Algorand: Scaling Byzantine agreements for cryptocurrencies. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 51--68, 2017.

Digital Library

[46]

R. Guerraoui, N. Knežević, V. Quéma, and M. Vukolić. The next 700 BFT protocols. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 363--376, 2010.

Digital Library

[47]

G. G. Gueta, I. Abraham, S. Grossman, D. Malkhi, B. Pinkas, M. K. Reiter, D.-A. Seredinschi, O. Tamir, and A. Tomescu. SBFT: A scalable decentralized trust infrastructure for blockchains. arXiv:1804.01626, 2018.

[48]

A. Haeberlen, P. Aditya, R. Rodrigues, and P. Druschel. Accountable virtual machines. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), page 119--134, 2010.

[49]

J. Hendricks, S. Sinnamohideen, G. R. Ganger, and M. K. Reiter. Zzyzx: Scalable fault tolerance through Byzantine locking. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), pages 363--372, 2010.

[50]

M. Herlihy and M. Moir. Enhancing accountability and trust in distributed ledgers. arXiv:1606.07490, 2016.

[51]

IBM. Transform cross-border payments with IBM blockchain world wire. https://www.ibm.com/blockchain/solutions/world-wire, 2020.

[52]

K. Itakura and K. Nakamura. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development, (71):1--8, 1983.

[53]

F. P. Junqueira, B. C. Reed, and M. Serafini. Zab: High-performance broadcast for primary-backup systems. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), pages 245--256, 2011.

Digital Library

[54]

M. Kelkar, F. Zhang, S. Goldfeder, and A. Juels. Order-fairness for Byzantine consensus. In Proceedings of the International Cryptology Conference (CRYPTO), 2020.

Digital Library

[55]

E. Kokoris-Kogias, P. Jovanovic, L. Gasser, N. Gailly, E. Syta, and B. Ford. Omniledger: A secure, scale-out, decentralized ledger via sharding. In Proceedings of the IEEE Symposium on Security and Privacy (S&P), pages 583--598, 2018.

[56]

R. Kotla, A. Clement, E. L. Wong, L. Alvisi, and M. Dahlin. Zyzzyva: speculative Byzantine fault tolerance. Commun. ACM, 51(11):86--95, 2008.

Digital Library

[57]

R. Kotla and M. Dahlin. High throughput Byzantine fault tolerance. In Proceedings of the International Conference on Dependable Systems and Networks (DSN), pages 575--584, 2004.

[58]

T. Kraska, G. Pang, M. J. Franklin, S. Madden, and A. Fekete. MDCC: Multi-data center consistency. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 113--126, 2013.

Digital Library

[59]

H. T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM Transactions on Database Systems (TODS), 6(2):213--226, 1981.

[60]

K. Kursawe. Wendy, the good little fairness widget: Achieving order fairness for blockchains. In Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pages 25--36, 2020.

Digital Library

[61]

L. Lamport. The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133--169, 1998.

[62]

L. Lamport. Paxos made simple. ACM SIGACT News (Distributed Computing Column), 32(4):51--58, 2001.

[63]

L. Lamport. Fast Paxos. Technical Report Microsoft Research Technical Report MSR-TR-2005-112, 2005.

[64]

L. Lamport. Generalized consensus and paxos. Technical Report Microsoft Research Technical Report MSR-TR-2005-33, 2005.

[65]

L. Lamport. Byzantizing paxos by refinement. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 211--224, 2011.

[66]

B. Lampson. The ABCD's of paxos. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), volume 1, page 13, 2001.

[67]

B. Li, W. Xu, M. Z. Abid, T. Distler, and R. Kapitza. Sarek: Optimistic parallel ordering in Byzantine fault tolerance. In Proceedings of the European Dependable Computing Conference (EDCC), pages 77--88, 2016.

[68]

C. Li, D. Porto, A. Clement, J. Gehrke, N. Preguiça, and R. Rodrigues. Making geo-replicated systems fast as possible, consistent when necessary. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 265--278, 2012.

[69]

H. C. Li, A. Clement, A. S. Aiyer, and L. Alvisi. The Paxos register. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS), pages 114--126, 2007.

[70]

B. Liskov. From viewstamped replication to Byzantine fault tolerance. In Replication, pages 121--149. Springer, 2010.

[71]

B. Liskov and J. Cowling. Viewstamped replication revisited. Technical Report MIT-CSAIL-TR-2012-021, MIT, July 2012.

[72]

B. Liskov and R. Rodrigues. Tolerating Byzantine faulty clients in a quorum system. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS), pages 34--34, 2006.

Digital Library

[73]

A. F. Luiz, L. C. Lung, and M. Correia. Byzantine fault-tolerant transaction processing for replicated databases. In Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA), pages 83--90, 2011.

Digital Library

[74]

D. Malkhi, K. Nayak, and L. Ren. Flexible Byzantine fault tolerance. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), pages 1041--1053, 2019.

Digital Library

[75]

D. Malkhi and M. Reiter. Byzantine quorum systems. In Distributed computing, volume 11, pages 203--213. Springer, 1998.

[76]

J.-P. Martin and L. Alvisi. Fast byzantine consensus. IEEE Transactions on Dependable and Secure Computing, 3(3):202--215, 2006.

Digital Library

[77]

R. C. Merkle. A digital signature based on a conventional encryption function. In Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT), pages 369--378. Springer, 1987.

[78]

meter.io. Supercharge ethereum for the financial internet. https://www.meter.io/.

[79]

S. Micali, K. Ohta, and L. Reyzin. Accountable-subgroup multisignatures. In Proceedings of the 8th ACM Conference on Computer and Communications Security, pages 245--254, 2001.

Digital Library

[80]

A. Miller, Y. Xia, K. Croman, E. Shi, and D. Song. The honey badger of BFT protocols. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pages 31--42, 2016.

Digital Library

[81]

I. Moraru, D. G. Andersen, and M. Kaminsky. There is more consensus in egalitarian parliaments. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 358--372, 2013.

Digital Library

[82]

S. Mu, Y. Cui, Y. Zhang, W. Lloyd, and J. Li. Extracting more concurrency from distributed transactions. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 479--494, 2014.

[83]

S. Mu, L. Nelson, W. Lloyd, and J. Li. Consolidating concurrency control and consensus for commits under conflicts. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 517--532, 2016.

[84]

B. M. Oki and B. H. Liskov. Viewstamped replication: A new primary copy method to support highly-available distributed systems. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 8--17, 1988.

[85]

D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the USENIX Annual Technical Conference (ATC), pages 305--319, 2014.

Digital Library

[86]

R. Padilha, E. Fynn, R. Soulé, and F. Pedone. Callinicos: Robust transactional storage for distributed data structures. In Proceedings of the USENIX Annual Technical Conference (ATC), pages 223--235, 2016.

[87]

R. Padilha and F. Pedone. Augustus: Scalable and robust storage for cloud applications. In Proceedings of the ACM European Conference on Computer Systems (EuroSys), pages 99--112, 2013.

Digital Library

[88]

C. H. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM (JACM), 26(4):631--653, 1979.

[89]

S. J. Park and J. Ousterhout. Exploiting commutativity for practical fast replication. In Proceedings of the USENIX Symposium on Networked Systems Design and Implementation (NSDI), pages 47--64, 2019.

[90]

F. Pedone and N. Schiper. Byzantine fault-tolerant deferred update replication. Journal of the Brazilian Computer Society, 18(1):3--18, 2012.

[91]

H. Pervez, M. Muneeb, M. U. Irfan, and I. U. Haq. A comparative analysis of dag-based blockchain architectures. In Proceedings of the IEEE International Conference on Open Source Systems and Technologies (ICOSST), pages 27--34, 2018.

[92]

M. Pires, S. Ravi, and R. Rodrigues. Generalized paxos made Byzantine (and less complex). Algorithms, 11(9):141, 2018.

[93]

S. Popov and Q. Lu. IOTA: feeless and free. IEEE Blockchain Technical Briefs, 2019.

[94]

D. P. Reed. Implementing atomic actions on decentralized data. ACM Transactions on Computer Systems (TOCS), 1(1):3--23, 1983.

[95]

T. Rocket, M. Yin, K. Sekniqi, R. van Renesse, and E. G. Sirer. Scalable and probabilistic leaderless BFT consensus through metastability. arXiv:1906.08936, 2019.

[96]

F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299--319, 1990.

Digital Library

[97]

V. Shoup. Practical threshold signatures. In International Conference on the Theory and Applications of Cryptographic Techniques, pages 207--220. Springer, 2000.

[98]

C. Stathakopoulou, T. David, and M. Vukolić. Mir-BFT: High-throughput BFT for blockchains. arXiv:1906.05552, 2019.

[99]

C. Su, N. Crooks, C. Ding, L. Alvisi, and C. Xie. Bringing modular concurrency control to the next level. In Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD '17, pages 283--297, 2017.

Digital Library

[100]

P. Sutra and M. Shapiro. Fast genuine generalized consensus. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS), pages 255--264, 2011.

Digital Library

[101]

The Linux Foundation. An introduction to Hyperledger. https://www.hyperledger.org/wp-content/uploads/2018/07/HL_Whitepaper_IntroductiontoHyperledger.pdf, 2018.

[102]

The Linux Foundation. Change healthcare using Hyperledger Fabric to improve claims lifecycle throughput and transparency, 2019.

[103]

Transaction Processing Performance Council. The TPC-C home page. http://www.tpc.org/tpcc.

[104]

R. Van Renesse, N. Schiper, and F. B. Schneider. Vive la différence: Paxos vs. viewstamped replication vs. zab. IEEE Transactions on Dependable and Secure Computing, 12(4):472--484, 2014.

Digital Library

[105]

B. Vandiver, H. Balakrishnan, B. Liskov, and S. Madden. Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 59--72, 2007.

Digital Library

[106]

C. Xie, C. Su, C. Littley, L. Alvisi, M. Kapritsos, and Y. Wang. High-performance ACID via modular concurrency control. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), 2015.

Digital Library

[107]

X. Yan, L. Yang, H. Zhang, X. C. Lin, B. Wong, K. Salem, and T. Brecht. Carousel: Low-latency transaction processing for globally-distributed data. In Proceedings of the International Conference on Management of Data (SIGMOD), pages 231--243, 2018.

Digital Library

[108]

J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 253--267, 2003.

Digital Library

[109]

M.Yin. libhotstuff. https://github.com/hot-stuff/libhotstuff.

[110]

M. Yin, D. Malkhi, M. K. Reiter, G. G. Gueta, and I. Abraham. Hot-Stuff: BFT consensus with linearity and responsiveness. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 347--356, 2019.

[111]

M. Zamani, M. Movahedi, and M. Raykova. Rapidchain: Scaling blockchain via full. In Proceedings of the ACM Conference on Computer and Communications Security (CCS), pages 931--948, 2018.

Digital Library

[112]

I. Zhang, N. K. Sharma, A. Szekeres, A. Krishnamurthy, and D. R. Ports. When is operation ordering required in replicated transactional storage? IEEE Data Engineering Bulletin, 39(1):27--38, 2016.

[113]

I. Zhang, N. K. Sharma, A. Szekeres, A. Krishnamurthy, and D. R. K. Ports. Building consistent transactions with inconsistent replication. In Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pages 263--278, 2015.

Digital Library

[114]

Y. Zhang, S. Setty, Q. Chen, L. Zhou, and L. Alvisi. Byzantine ordered consensus without Byzantine oligarchy. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 633--649, 2020.

Cited By

Chu DPanchapakesan RLaddad SKatahanas LLiu CShivakumar KCrooks NHellerstein JHoward H(2024)Optimizing Distributed Protocols with Query RewritesProceedings of the ACM on Management of Data10.1145/36392572:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639257
Kida AKawashima H(2024)Accelerating BFT Database with Transaction Reconstruction2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00061(232-241)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00061
Crooks N(2023)Efficient Data Sharing across Trust DomainsACM SIGMOD Record10.1145/3615952.361596252:2(36-37)Online publication date: 11-Aug-2023
https://dl.acm.org/doi/10.1145/3615952.3615962
Show More Cited By

Index Terms

Basil: Breaking up BFT with ACID (transactions)
1. Computer systems organization
  1. Dependable and fault-tolerant systems and networks
2. Security and privacy
  1. Database and storage security
  2. Systems security
    1. Distributed systems security

Recommendations

Multi-Threshold Byzantine Fault Tolerance
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security

Classic Byzantine fault tolerant (BFT) protocols are designed for a specific timing model, most often one of the following: synchronous, asynchronous or partially synchronous. It is well known that the timing model and fault tolerance threshold present ...
Non-blocking Atomic Commitment with Byzantine Faults
SBRC '14: Proceedings of the 2014 Brazilian Symposium on Computer Networks and Distributed Systems

In this work we present the Byzantine Fault Tolerant Non-Blocking Weak Atomic Commitment (BFTNBWAC), a new proposal to solve the Non-Blocking Atomic Commitment (NBAC) problem, where the participants of protocol may fail in a Byzantine way. Our approach ...
Byzantine Fault Tolerance in the Age of Blockchains and Cloud Computing
CCSW'22: Proceedings of the 2022 on Cloud Computing Security Workshop

BFT is a generic technique used for ordering transactions on a distributed system even if a fraction of the processes are controlled by a malicious adversary. BFT is widely known as the model for permissioned blockchains, and is increasingly used in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

SOSP '21: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles

October 2021

899 pages

ISBN:9781450387095

DOI:10.1145/3477132

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
USENIX Assoc: USENIX Assoc

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

NSF (National Science Foundation)

Conference

SOSP '21

Sponsor:

SIGOPS
USENIX Assoc

SOSP '21: ACM SIGOPS 28th Symposium on Operating Systems Principles

October 26 - 29, 2021

Virtual Event, Germany

Acceptance Rates

Overall Acceptance Rate 131 of 716 submissions, 18%

Upcoming Conference

SOSP '24

Sponsor:
sigops

ACM SIGOPS 30th Symposium on Operating Systems Principles

November 4 - 6, 2024

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
2,322
Total Downloads

Downloads (Last 12 months)619
Downloads (Last 6 weeks)75

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chu DPanchapakesan RLaddad SKatahanas LLiu CShivakumar KCrooks NHellerstein JHoward H(2024)Optimizing Distributed Protocols with Query RewritesProceedings of the ACM on Management of Data10.1145/36392572:1(1-25)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639257
Kida AKawashima H(2024)Accelerating BFT Database with Transaction Reconstruction2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)10.1109/IPDPSW63119.2024.00061(232-241)Online publication date: 27-May-2024
https://doi.org/10.1109/IPDPSW63119.2024.00061
Crooks N(2023)Efficient Data Sharing across Trust DomainsACM SIGMOD Record10.1145/3615952.361596252:2(36-37)Online publication date: 11-Aug-2023
https://dl.acm.org/doi/10.1145/3615952.3615962
Lai ZLiu CLo E(2023)When Private Blockchain Meets Deterministic DatabaseProceedings of the ACM on Management of Data10.1145/35889521:1(1-28)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588952
Zarbafian PGramoli V(2023)Lyra: Fast and Scalable Resilience to Reordering Attacks in Blockchains2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS54959.2023.00097(929-939)Online publication date: May-2023
https://doi.org/10.1109/IPDPS54959.2023.00097
Gai FNiu JBeschastnikh IFeng CWang S(2023)Scaling Blockchain Consensus via a Robust Shared Mempool2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00047(530-543)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00047
Gupta SRahnama SLinsenmayer ENawab FSadoghi M(2023)Reliable Transactions in Serverless-Edge Architecture2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00030(301-314)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00030
Nemoto JYamada H(2023)The Case for Lazy Byzantine Fault Detection for Transactional Database Systems2023 IEEE 43rd International Conference on Distributed Computing Systems Workshops (ICDCSW)10.1109/ICDCSW60045.2023.00005(13-18)Online publication date: 18-Jul-2023
https://doi.org/10.1109/ICDCSW60045.2023.00005
Peng ZZhang YXu QLiu HGao YLi XYu G(2022)NeuChainProceedings of the VLDB Endowment10.14778/3551793.355181615:11(2585-2598)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551816
El-Hindi MArora AKarrer SBinnig C(2022)Towards a Benchmark for Shared Databases [Vision Paper]Datenbank-Spektrum10.1007/s13222-022-00429-822:3(227-239)Online publication date: 6-Dec-2022
https://doi.org/10.1007/s13222-022-00429-8

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents