{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U4FC237DXRA24T724QY5DXIRDQ","short_pith_number":"pith:U4FC237D","schema_version":"1.0","canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","source":{"kind":"arxiv","id":"1412.6016","version":1},"attestation_state":"computed","paper":{"title":"Complexity of distance fraud attacks in graph-based distance bounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Rolando Trujillo-Rasua","submitted_at":"2014-11-19T16:06:29Z","abstract_excerpt":"Distance bounding (DB) emerged as a countermeasure to the so-called \\emph{relay attack}, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $G = (V, E)$ and a vertex $v \\in V$, is able to find the most frequent $n$-long sequence in $G$ starting from $v$ (MFS problem). However, to the best of our knowledge"},"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":"1412.6016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-11-19T16:06:29Z","cross_cats_sorted":[],"title_canon_sha256":"54f3b7324daa787345cdbfd03e2d6b39d37e6be9d8e8d470b1883a9b45470be1","abstract_canon_sha256":"aca85069b661af8bdeb8da734f319531edcaa485f4e45b8b995e727363899068"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:55.696002Z","signature_b64":"Jpnv9PzqITo4me6B4D47s4uzASL/22GFk5zvT6YH4zFCMoscsybUbs0JLJZQ1NnjUBDmBZ305WBTo1V7+bD+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70a2d6fe3bc41ae4ffae431d1dd111c33e65470a9ed775b12fda1be4b4a1eaa","last_reissued_at":"2026-05-18T02:30:55.695478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:55.695478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of distance fraud attacks in graph-based distance bounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Rolando Trujillo-Rasua","submitted_at":"2014-11-19T16:06:29Z","abstract_excerpt":"Distance bounding (DB) emerged as a countermeasure to the so-called \\emph{relay attack}, which affects several technologies such as RFID, NFC, Bluetooth, and Ad-hoc networks. A prominent family of DB protocols are those based on graphs, which were introduced in 2010 to resist both mafia and distance frauds. The security analysis in terms of distance fraud is performed by considering an adversary that, given a vertex labeled graph $G = (V, E)$ and a vertex $v \\in V$, is able to find the most frequent $n$-long sequence in $G$ starting from $v$ (MFS problem). However, to the best of our knowledge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6016","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":"1412.6016","created_at":"2026-05-18T02:30:55.695550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6016v1","created_at":"2026-05-18T02:30:55.695550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6016","created_at":"2026-05-18T02:30:55.695550+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4FC237DXRA2","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4FC237DXRA24T72","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4FC237D","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/U4FC237DXRA24T724QY5DXIRDQ","json":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ.json","graph_json":"https://pith.science/api/pith-number/U4FC237DXRA24T724QY5DXIRDQ/graph.json","events_json":"https://pith.science/api/pith-number/U4FC237DXRA24T724QY5DXIRDQ/events.json","paper":"https://pith.science/paper/U4FC237D"},"agent_actions":{"view_html":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ","download_json":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ.json","view_paper":"https://pith.science/paper/U4FC237D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6016&json=true","fetch_graph":"https://pith.science/api/pith-number/U4FC237DXRA24T724QY5DXIRDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/U4FC237DXRA24T724QY5DXIRDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/action/storage_attestation","attest_author":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/action/author_attestation","sign_citation":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/action/citation_signature","submit_replication":"https://pith.science/pith/U4FC237DXRA24T724QY5DXIRDQ/action/replication_record"}},"created_at":"2026-05-18T02:30:55.695550+00:00","updated_at":"2026-05-18T02:30:55.695550+00:00"}