COBRA: Dynamic Proactive Secret Sharing for Confidential BFT Services
Robin Vassantlal, Eduardo Alchieri, Bernardo Ferreira, Alysson Bessani
Abstract
Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) is a classical paradigm for implementing trustworthy services that has received renewed interest with the emergence of blockchains and decentralized infrastructures. A fundamental limitation of BFT SMR is that it provides integrity and availability despite a fraction of the replicas being controlled by an active adversary, but does not offer any confidentiality protection. Previous works addressed this issue by integrating secret sharing with the consensus-based framework of BFT SMR, but without providing all features required by practical systems, which include replica recovery, group reconfiguration, and acceptable performance when dealing with a large number of secrets. We present COBRA, a new protocol stack for Dynamic Proactive Secret Sharing that allows implementing confidentiality in practical BFT SMR systems. COBRA exhibits the best asymptotic communication complexity and optimal storage overhead, being able to renew 100k shares in a group of ten replicas faster than the current state of the art.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 345e6502-5ac5-46e5-95b2-a0dc7be9d358Cited by top-tier papers9
- Qanaat: A Scalable Multi-Enterprise Permissioned Blockchain System with Confidentiality GuaranteesMohammad Javad Amiri, Boon Thau Loo, Divy Agrawal, Amr El AbbadiVLDB 2022 · 26 citations
- PrestigeBFT: Revolutionizing View Changes in BFT Consensus Algorithms with Reputation MechanismsGengrui Zhang, Fei Pan, Sofia Tijanic, Hans-Arno JacobsenICDE 2024 · 21 citations
- Tolerating Disasters with Hierarchical ConsensusWassim Yahyaoui, Joachim Bruneau-Queyreix, Marcus Völp, Jérémie DecouchantINFOCOM 2024 · 3 citations
- Rondo: Scalable and Reconfiguration-Friendly Randomness BeaconXuanji Meng, Xiao Sui, Zhaoxin Yang, Kang Rong et al.NDSS 2025
- Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial SamplingSourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, Ling RenUSENIX Security 2023
Related papers
- Efficient Verifiable Secret Sharing with Share Recovery in BFT ProtocolsSoumya Basu, Alin Tomescu, Ittai Abraham, Dahlia Malkhi et al.CCS 2019 · 38 citations
- Byzantine Ordered Consensus without Byzantine OligarchyYunhao Zhang, Srinath T. V. Setty, Qi Chen, Lidong Zhou et al.OSDI 2020 · 131 citations
- Multi-Threshold Byzantine Fault ToleranceAtsuki Momose, Ling RenCCS 2021 · 1 citation
- Recover from Excessive Faults in Partially-Synchronous BFT SMRTiantian Gong, Gustavo Franco Camilo, Kartik Nayak, Andrew Lewis-Pye et al.USENIX Security 2025
- Bandle: Asynchronous State Machine Replication Made EfficientBo Wang, Shengyun Liu, He Dong, Xiangzhe Wang et al.EuroSys 2024 · 4 citations
