DataCite
metadata only
Theory and tool support for the formal verification of cryptographic protocols
Cryptographic protocols are an essential component of network communications. Despite their relatively small size compared to other distributed algorithms, they are known to be error-prone. This is due to the obligation to behave robustly in the context of unknown hostile attackers who might want to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Algorithmics and automatic tools for the construction and analysis of symmetric-key cryptography components#1251103
- Strategy for Verifying Security Protocols with Unbounded Message Size#175878
- A Decidable Analysis of Security Protocols#175868
- ShannonProver: Towards Automating Formal Cryptographic Proofs#1198965
- Scenario Proofs for Verification of Distributed Protocols#1326658
Record · ID 1407099
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive