Reordering messages across executions, this Byzantine agreement paper pins tight composition bounds and compilers.
trending13
01 02 When Topology Betrays Privacy: Lattice-Based Reconstruction Attacks on Secure Aggregation in Decentralized Federated Learning arxiv.orgSparse topologies let lattice attacks turn secure aggregation into update recovery, rude but mathematically on-brand.03 Turns out early-stopping BA papers weren't even counting rounds the same way, so this ePrint separates send-only from send/recv rounds.04 Maps when PQ distributed authorization still counts as a native signature, and when the verifier quietly stops cooperating.05 A post on Interfold's ciphernodes for threshold decryption in E3, because apparently one key holder was too optimistic.06 Can row subnets take blob reconstruction off the beefy nodes? RowDAS (EIP-8371) has Prysm measurements and fallback data.07 A settlement protocol for agent side effects, with typed receipts, optimistic challenges, and on-chain collateral, because audits now.08 Paper on policy-relative effect closure for auth/revocation, with EFFECTBOUND and proofs; completion is still doing its own thing.09 Paper detects privacy risks that only show up when processors compose, then folds them into DPIAs.10 Delegation Without Trust: An Empirical Gap Analysis of Identity, Authorization, and Runtime Governance in Multi-Agent LLM Systems arxiv.orgPaper on untrusted multi-agent LLMs, finds most frameworks leak authority, and a broker stops replay/escalation in microseconds.11 Centralized transaction dispatch turns out to be the trick for deterministic scale-out smart contracts.12 Practical Silent Threshold Signatures and Silent Threshold Encryption for Dynamic Committees eprint.iacr.orgPaper on silent threshold signatures and encryption for dynamic committees, skipping DKG and some global-sized misery.13 AVID with a 2D matrix code, keeping retrieval optimal while trimming recovery cost, unlike the usual storage or communication tax.