The results show that message complexity alone poorly predicts latency, that optimistic paths can be dominated by recovery cost, and that batching or packing helps only when verification stays off the critical path.
Abstract
Modern secret sharing protocols promise robust secret sharing in fully asynchronous Byzantine systems, but their practical costs remain difficult to compare across papers, assumptions, and workloads. The difficulty is not merely experimental: protocols with similar asymptotic guarantees often place very different work on the critical path through their choices of dissemination, verification, batching, and recovery. This paper turns that fragmented research landscape into a corpus-backed designspace analysis and systems evaluation of asynchronous verifiable and complete secret sharing. We derive a design sieve, select seven representative protocols, and implement them in a common Rust framework. In our experiments on the Grid'5000 platform, we evaluate honest-dealer and faulty-dealer stress executions using latency, throughput, message count, bandwidth, and aggregate CPU-time. The results show that message complexity alone poorly predicts latency, that optimistic paths can be dominated by recovery cost, and that batching or packing helps only when verification stays off the critical path. These findings turn protocol-by-protocol comparisons into design-to-cost guidance for choosing, implementing, and extending asynchronous verifiable and complete sharing protocols.
VeriRouter is presented, a verifiable LLM routing framework that combines ZK proofs with a provider-issued serving certificate to establish integrity across both planes while keeping the router's private routing assets hidden from clients.
Meng-Yu Yao, Zi-Qi Zhang, Shao-Fei Li et al.· 0 citations
BigBFT is proposed, a BFT transactional store that scales by sharding the state but not the execution, which keeps a single consensus protocol to order transactions globally, while multiple node shards replicate state partitions and process state access in parallel.
Guang-Da Sun, Jia-Lin Li· Proceedings of the 17th ACM...· 0 citations
A novel Byzantine-tolerant causal ordering algorithm that achieves an optimal application message space overhead for point-to-point messages and formally proves that the algorithm guarantees system-wide liveness and satisfies a weakened causal safety abstraction called Congestion-Relaxed Causal Delivery.
Fault-tolerant agreement protocols fail if replicas share a common flaw that simultaneously affects more replicas than the tolerable threshold. Therefore replicas should ideally fail independently, which can be achieved through diversification. However, in practice, often the same protocol implementation is shared by a...
Arne Vogel, Christian Berger, R. Kapitza· arXiv.org· 0 citations
Deterministic variants of CSIDH remove randomness from the group action, either through implementation techniques or, as in Houben's deterministic CSIDH and OSIDH-LD, by design. Since earlier fault attacks on CSIDH mostly target random point sampling, determinism seems to close that avenue. We show that it opens anothe...
Data clean rooms (DCRs) are the cloud industry's answer to confidential multi-party data sharing under regulations such as GDPR and the EU Data Act, yet their trustworthiness hinges on hand-written distributed code: developers must weave audit logging and fault recovery into message-passing protocols without breaking t...
A. Ionescu, Alejandro Russo· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.