{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VQR7X3UHWJEK5CPL7RSGRP6IVQ","short_pith_number":"pith:VQR7X3UH","schema_version":"1.0","canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","source":{"kind":"arxiv","id":"1312.6532","version":1},"attestation_state":"computed","paper":{"title":"Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew D. Gordon, David A. Naumann, Fran\\c{c}ois Dupressoir, Jan J\\\"urjens","submitted_at":"2013-12-23T12:05:34Z","abstract_excerpt":"We describe how to verify security properties of C code for cryptographic protocols by using a general-purpose verifier. We prove security theorems in the symbolic model of cryptography. Our techniques include: use of ghost state to attach formal algebraic terms to concrete byte arrays and to detect collisions when two distinct terms map to the same byte array; decoration of a crypto API with contracts based on symbolic terms; and expression of the attacker model in terms of C programs. We rely on the general-purpose verifier VCC; we guide VCC to prove security simply by writing suitable heade"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.6532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-12-23T12:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"0132673760b0cf07c3904843b4ed762626d668c32a72bd4851ef421908998f82","abstract_canon_sha256":"10f06ed4c38068efa1d123c66ec1231a7a91218f238869ca3e6aa6b1c363451b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:58.001205Z","signature_b64":"2imwOFmFRdfxT3MP9ikFABiEK50PbSuyvKtBQmak5lHBVGQ+kGhJVgunlRB3nOFym58xQn3fNCiHg7pHqdrPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac23fbee87b248ae89ebfc6468bfc8ac101db4cb830b02d7cddb1ee7d3081fb8","last_reissued_at":"2026-05-18T03:03:58.000471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:58.000471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guiding a General-Purpose C Verifier to Prove Cryptographic Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Andrew D. Gordon, David A. Naumann, Fran\\c{c}ois Dupressoir, Jan J\\\"urjens","submitted_at":"2013-12-23T12:05:34Z","abstract_excerpt":"We describe how to verify security properties of C code for cryptographic protocols by using a general-purpose verifier. We prove security theorems in the symbolic model of cryptography. Our techniques include: use of ghost state to attach formal algebraic terms to concrete byte arrays and to detect collisions when two distinct terms map to the same byte array; decoration of a crypto API with contracts based on symbolic terms; and expression of the attacker model in terms of C programs. We rely on the general-purpose verifier VCC; we guide VCC to prove security simply by writing suitable heade"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6532","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.6532","created_at":"2026-05-18T03:03:58.000577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6532v1","created_at":"2026-05-18T03:03:58.000577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6532","created_at":"2026-05-18T03:03:58.000577+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQR7X3UHWJEK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQR7X3UHWJEK5CPL","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQR7X3UH","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ","json":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ.json","graph_json":"https://pith.science/api/pith-number/VQR7X3UHWJEK5CPL7RSGRP6IVQ/graph.json","events_json":"https://pith.science/api/pith-number/VQR7X3UHWJEK5CPL7RSGRP6IVQ/events.json","paper":"https://pith.science/paper/VQR7X3UH"},"agent_actions":{"view_html":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ","download_json":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ.json","view_paper":"https://pith.science/paper/VQR7X3UH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6532&json=true","fetch_graph":"https://pith.science/api/pith-number/VQR7X3UHWJEK5CPL7RSGRP6IVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/VQR7X3UHWJEK5CPL7RSGRP6IVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/action/storage_attestation","attest_author":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/action/author_attestation","sign_citation":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/action/citation_signature","submit_replication":"https://pith.science/pith/VQR7X3UHWJEK5CPL7RSGRP6IVQ/action/replication_record"}},"created_at":"2026-05-18T03:03:58.000577+00:00","updated_at":"2026-05-18T03:03:58.000577+00:00"}