Trust a Few: The Weakest Assumptions a Protocol Needs

arXiv:2610.09730 · cs.CR · Submitted 2026-10-07 · Read on arXiv

cs.CR

Submitted: 2026-10-07

Updated: 2026-10-07

Terminology

• Verifier — 41× in this paper · explained in 2 episodes
• Core — 8× in this paper · explained in 2 episodes
• Hypergraph — 7× in this paper · explained in 2 episodes
• Verification — 7× in this paper · explained in 2 episodes
• Trace — 6× in this paper · explained in 2 episodes
• IEEE Computer Security Foundations Workshop — 2× in this paper
• Network and Distributed System Security Symposium — 2× in this paper
• Pruning — 2× in this paper · explained in 4 episodes
• Transformer — 2× in this paper · explained in 2 episodes
• Formal Methods — 1× in this paper · explained in 3 episodes
• Formal Verification — 1× in this paper · explained in 2 episodes

Sources

• Deducing Security Goals From Shape Analysis Sentences
• Using Rely/Guarantee to Pinpoint Assumptions underlying Security Protocols

Related papers

• SoK: AI-Augmented Binary Reversing
• Relaxed Sender Anonymity for CBDC Interbank Settlement: A Zero-Knowledge Approach on Permissioned EVM
• Calibration-Family Overfit: Why Trusted Sabotage Monitors Don't Transfer Across Lineages
• Efficient Fuzzy PSI under One-Sided Assumptions
• Sealing the Audit-Runtime Gap for LLM Skills
• Token Composition: A Graph Based on EVM Logs