Backend
Playing the SMR Game with Existential Honesty
arXiv cs.CR0 views
arXiv:2611.24586v1 Announce Type: new Abstract: State machine replication protocols are usually proven secure in the honest-Byzantine setting, which requires an honest supermajority of validators. Deployed systems offer no such guarantee: validators participate for profit and may deviate from the protocol whenever doing so increases their gains. In our work, every validator is rational or Byzantine, and none is honest. Rational validators may collude with each other and with the Byzantine ones, who may also bribe them to deviate. Known impossibility results show that, without honest validators, clients that decide whether to accept a transaction based on a non-interactive certificate and without further communication cannot be kept safe. To bypass these results, we let clients relay the certificates they receive to full nodes and wait before confirming transactions. We also assume that one full node, whose identity is unknown, is honest and always online. Under this assumption, we build a finalization layer over any certifiable quorum-based protocol in a synchronous network. Clients run an existing freezing gadget and fetch past certificates from the honest full node, which makes the protocol \emph{always-safe}: no two honest clients confirm conflicting ledgers, for any strategy of the validators. We incentivize participation through rewards, which the adversary may use to bribe rational validators into censoring transactions. In this setting, we formalize censorship and characterize it tightly: paying only with his rewards, the adversary censors less than a $\bw$ fraction of the available fees at each height, where $\bw$ is the fraction of the quorum he signs, and every coin of censorship beyond that comes from his own funds.
Source:https://arxiv.org/abs/2611.24586PreviousProbing agent overeagerness in realistic settings with continuation auditsNextRobust, Lightweight Locally Differentially Private Histogram Estimation and the Role of Dropout Attacks
Related posts
Fast Bayesian Methods for Uncertainty Quantification in Sparse AI Evaluation
0arXiv stat.CO
How to Tell If Your Phone Has Been Hacked: 5 Common Signs
0FOSS Bytes
Databricks Wins A-Team Award for AI in Capital Markets
0Databricks Blog
Event Analytics Platform & RFID Attendee Tracking in Saudi Arabia
0dev.to Data

10 Adımda Yapay Zeka Otomasyonu ile Öğrenme Hızımı Nasıl 3 Katına Çıkardım
0dev.to Data
What 50 Backlinks Taught Me About Building a Niche Site in Public
0dev.to Discuss