formal privacy verification

Protocol designers often face a high barrier to entry in using formal verification tools such as ProVerif and Tamarin due to the lack of systematic guidance on translating security properties into executable models. This work addresses this gap by conducting a systematic review of 53 studies published between 2022 and 2025, resulting in the first comprehensive taxonomy of security properties tailored to mainstream verification tools. The taxonomy integrates informal explanations, first-order logic definitions, and tool-specific modeling exemplars. By bridging the gap between theoretical formulations and practical modeling, this study significantly enhances the accuracy and efficiency of protocol modeling. An accompanying open-source repository of illustrative examples further lowers the practical barrier to adopting formal verification in real-world protocol design.

This project addresses core challenges in cybersecurity verification—namely correctness, robustness, and adaptability to dynamic threats—focusing on access control, protocol design, vulnerability detection, and adversarial modeling. Methodologically, it introduces a novel formal verification framework that synergistically integrates temporal, deontic, and epistemic logics with neurosymbolic AI, enabling the first systematic co-reasoning between multimodal logical modeling and neural computation. The framework unifies model checking, interactive theorem proving, symbolic execution, and security toolchains, thereby overcoming combinatorial explosion and scalability limitations in large-scale system verification. Its primary contributions are: (1) the first explainable, scalable, and automated verification methodology covering mainstream security scenarios; (2) identification of critical research gaps in formal–empirical integration; and (3) a practical, implementable technical pathway toward provably secure next-generation systems.

This work addresses the challenge of verifying that confidential software adheres to publicly specified temporal functional properties without revealing its internal implementation. It introduces, for the first time, zero-knowledge proofs into deductive model checking and proposes a novel method capable of generating verifiable correctness certificates. The approach supports both explicit-state transition graphs and symbolic linear guarded command representations of systems, integrating key techniques including polynomial commitments, Farkas’ lemma, piecewise-linear ranking functions, and Sigma protocols—encompassing matrix multiplication and range proofs. A prototype implementation demonstrates the practicality of the method on LTL verification benchmarks, achieving strong formal guarantees while preserving system confidentiality.

This paper addresses the challenge in formal verification of cryptographic protocols—balancing rigorous correctness proofs with cross-layer reusability. To this end, we propose Cryptis, the first verification framework for authentication protocols built upon Iris separation logic. Our approach comprises three key contributions: (1) designing the first separation logic specification tailored to authentication protocols, unifying the modeling of protocol behavior and security properties; (2) enabling hierarchical verification of protocols and their composed systems within the symbolic cryptographic model; and (3) conducting end-to-end formal verification in Coq of multiple classical authentication protocols and a key-value storage server, formally establishing confidentiality, integrity, and authentication. Crucially, Cryptis supports systematic reuse of verified components at the system level, thereby enhancing composability and trustworthiness of cryptographic modules.

This work addresses the challenge of formally verifying mature, safety-critical industrial C++ codebases by strategically integrating theorem proving (PVS) and model checking (SeaHorn), augmented with large language models to assist in specification construction. The approach is applied to the core order book algorithm of Stellar’s SDEX blockchain module. The verification effort successfully establishes critical correctness properties—including state consistency and unreachability of erroneous states—uncovers discrepancies between documentation and implementation, and produces reusable formal artifacts. These assets enable continuous validation of invariants during future code evolution, thereby enhancing long-term reliability and maintainability of the system.

This work addresses the challenge of ensuring information-flow security when dynamically extending security lattices in concurrent systems. By extending an existing type system, it introduces—for the first time within the π-calculus—a scalable security lattice mechanism that supports runtime insertion of new security levels. The authors rigorously establish non-interference through reduction semantics and bisimulation equivalence. This approach overcomes the limitations of traditional static, binary security lattices by providing a formal verification framework that guarantees strict information isolation between high- and low-security levels, even as security policies are dynamically adjusted at runtime.

This work addresses the high barrier to entry in formal verification of cryptographic protocols and the difficulty of tracing verification results back to concrete implementations. The authors propose a domain-specific language (DSL)-centric development methodology that pioneers a “language-first” modeling paradigm. Their approach automatically translates protocol implementations into Tamarin-verifiable models and integrates symbolic execution to ensure memory safety. This framework guarantees that general trace properties established through formal verification are correctly mapped back to the original source code. Empirical evaluation demonstrates the successful generation of precise models for Signed Diffie-Hellman and WireGuard protocols; notably, the resulting WireGuard implementation achieves interoperability, practical usability, and compositional security guarantees.

This work addresses the growing complexity of cryptographic proofs and the high cost of manual verification and formal proof scripting. To tackle this challenge, the paper introduces ShannonProver, an agent-based automated framework that integrates with the EasyCrypt tool to synthesize formal proof scripts from user-specified security models and lemma-level proof obligations. This approach achieves, for the first time, the automated synthesis of proofs for numerous complex obligations arising in real-world protocols such as ChaChaPoly1305 and MEE-CBC. Evaluated on a diverse dataset encompassing textbook primitives, deployed protocols, and NIST proposals, ShannonProver substantially lowers the barrier to formal verification, thereby accelerating the development and deployment of trustworthy cryptographic protocols.

This work addresses the vulnerability of traditional privacy mechanisms, which often fail catastrophically upon exposure of system components, leading to sensitive information leakage. To mitigate this, the paper introduces a novel paradigm termed Semantic Non-Assemblability (SNA), wherein architectural design ensures that any set of exposed components below a defined threshold cannot reconstruct a meaningful input, thereby preventing inference of sensitive predicates. The approach innovatively incorporates architectural inertia, enabling privacy guarantees to degrade predictably—rather than collapse abruptly—when components are compromised, and integrates organizational audit constraints to enhance practicality. Leveraging a dual-channel provenance architecture, formal verification via ProVerif, structured protocols, and Birthmark-based attestation on constrained hardware, the system achieves unlinkability across devices, observer unidentifiability, server blindness, and correctness of active defense gates, delivering strong, deployable privacy assurances even on resource-limited platforms.