{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V6TST4YZNHGX4QDDRYEFHH4EGZ","short_pith_number":"pith:V6TST4YZ","schema_version":"1.0","canonical_sha256":"afa729f31969cd7e40638e08539f84364bf32ba14d7c13a62f2a115df657c841","source":{"kind":"arxiv","id":"1405.2738","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Tags for Security Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"CNRS & ENS Cachan), Myrto Arapinis (School of Computer Science, St\\'ephanie Delaune (LSV, Steve Kremer (INRIA Nancy - Grand-Est), University of Birmingham)","submitted_at":"2014-05-12T13:10:33Z","abstract_excerpt":"The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to the fact that protocols may interact with an arbitrary attacker which yields a verification problem that has several sources of unboundedness (size of messages, number of sessions, etc. In this paper, we characterize a class of protocols for which deciding security for an unbounded number of sessions is decidable. More precisely, we present a simple transformation which maps a protocol that is secure for a bounded num"},"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":"1405.2738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-05-12T13:10:33Z","cross_cats_sorted":[],"title_canon_sha256":"264d4f4dee215bb7cb698b68c8e222c165ae72e361f94659fbdc438ccc8d09dd","abstract_canon_sha256":"5885ec0b0102e813c2dccc52b8fde90f850983eebd323b531c98e5fdd1900843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.831496Z","signature_b64":"3TK1iN5yQEJncz6o9NKj/7KGMnnnthej2Vai7oHEmgUEE/MzOibfSP5Z/N3jTwwkOBIldrAea11MyUZp2gJzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa729f31969cd7e40638e08539f84364bf32ba14d7c13a62f2a115df657c841","last_reissued_at":"2026-05-18T01:37:35.831011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.831011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Tags for Security Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"CNRS & ENS Cachan), Myrto Arapinis (School of Computer Science, St\\'ephanie Delaune (LSV, Steve Kremer (INRIA Nancy - Grand-Est), University of Birmingham)","submitted_at":"2014-05-12T13:10:33Z","abstract_excerpt":"The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to the fact that protocols may interact with an arbitrary attacker which yields a verification problem that has several sources of unboundedness (size of messages, number of sessions, etc. In this paper, we characterize a class of protocols for which deciding security for an unbounded number of sessions is decidable. More precisely, we present a simple transformation which maps a protocol that is secure for a bounded num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2738","kind":"arxiv","version":2},"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":"1405.2738","created_at":"2026-05-18T01:37:35.831078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.2738v2","created_at":"2026-05-18T01:37:35.831078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2738","created_at":"2026-05-18T01:37:35.831078+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6TST4YZNHGX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6TST4YZNHGX4QDD","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6TST4YZ","created_at":"2026-05-18T12:28:52.271510+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/V6TST4YZNHGX4QDDRYEFHH4EGZ","json":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ.json","graph_json":"https://pith.science/api/pith-number/V6TST4YZNHGX4QDDRYEFHH4EGZ/graph.json","events_json":"https://pith.science/api/pith-number/V6TST4YZNHGX4QDDRYEFHH4EGZ/events.json","paper":"https://pith.science/paper/V6TST4YZ"},"agent_actions":{"view_html":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ","download_json":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ.json","view_paper":"https://pith.science/paper/V6TST4YZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.2738&json=true","fetch_graph":"https://pith.science/api/pith-number/V6TST4YZNHGX4QDDRYEFHH4EGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/V6TST4YZNHGX4QDDRYEFHH4EGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ/action/storage_attestation","attest_author":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ/action/author_attestation","sign_citation":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ/action/citation_signature","submit_replication":"https://pith.science/pith/V6TST4YZNHGX4QDDRYEFHH4EGZ/action/replication_record"}},"created_at":"2026-05-18T01:37:35.831078+00:00","updated_at":"2026-05-18T01:37:35.831078+00:00"}