{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DXKIMBMRPHUH7IUYJHL6M3AYZA","short_pith_number":"pith:DXKIMBMR","schema_version":"1.0","canonical_sha256":"1dd486059179e87fa29849d7e66c18c83b964e975a716f5cb30e7abae421c799","source":{"kind":"arxiv","id":"1601.04893","version":2},"attestation_state":"computed","paper":{"title":"Traffic Confirmation Attacks Despite Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jamie Hayes","submitted_at":"2016-01-19T12:32:54Z","abstract_excerpt":"We propose a traffic confirmation attack on low-latency mix networks based on computing robust real-time binary hashes of network traffic flows. Firstly, we adapt the Coskun-Memon Algorithm to construct hashes that can withstand network impairments to allow fast matching of network flows. The resulting attack has a low startup cost and achieves a true positive match rate of 80% when matching one flow out of 9000 with less than 2% false positives, showing traffic confirmation attacks can be highly accurate even when only part of the network traffic flow is seen. Secondly, we attack probabilisti"},"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":"1601.04893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-01-19T12:32:54Z","cross_cats_sorted":[],"title_canon_sha256":"b08963a61613c25f3f584dc7975590c24611bf38bbe1c7b1eda198827d511262","abstract_canon_sha256":"41477588430151adcb9d7907e4979905380943d20403cd2dea7163a093b27e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.467203Z","signature_b64":"13cgwen9CV3/nBLXk/+Mk0s7iZ3QCV8XUc1uLGhcHW4eX9Yys9GxOC4VlYVFCEq++/L+2lusvEjJ5OYJ/0buAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dd486059179e87fa29849d7e66c18c83b964e975a716f5cb30e7abae421c799","last_reissued_at":"2026-05-18T01:20:55.466578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.466578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Traffic Confirmation Attacks Despite Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jamie Hayes","submitted_at":"2016-01-19T12:32:54Z","abstract_excerpt":"We propose a traffic confirmation attack on low-latency mix networks based on computing robust real-time binary hashes of network traffic flows. Firstly, we adapt the Coskun-Memon Algorithm to construct hashes that can withstand network impairments to allow fast matching of network flows. The resulting attack has a low startup cost and achieves a true positive match rate of 80% when matching one flow out of 9000 with less than 2% false positives, showing traffic confirmation attacks can be highly accurate even when only part of the network traffic flow is seen. Secondly, we attack probabilisti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04893","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":"1601.04893","created_at":"2026-05-18T01:20:55.466679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04893v2","created_at":"2026-05-18T01:20:55.466679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04893","created_at":"2026-05-18T01:20:55.466679+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXKIMBMRPHUH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXKIMBMRPHUH7IUY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXKIMBMR","created_at":"2026-05-18T12:30:12.583610+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/DXKIMBMRPHUH7IUYJHL6M3AYZA","json":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA.json","graph_json":"https://pith.science/api/pith-number/DXKIMBMRPHUH7IUYJHL6M3AYZA/graph.json","events_json":"https://pith.science/api/pith-number/DXKIMBMRPHUH7IUYJHL6M3AYZA/events.json","paper":"https://pith.science/paper/DXKIMBMR"},"agent_actions":{"view_html":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA","download_json":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA.json","view_paper":"https://pith.science/paper/DXKIMBMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04893&json=true","fetch_graph":"https://pith.science/api/pith-number/DXKIMBMRPHUH7IUYJHL6M3AYZA/graph.json","fetch_events":"https://pith.science/api/pith-number/DXKIMBMRPHUH7IUYJHL6M3AYZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA/action/storage_attestation","attest_author":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA/action/author_attestation","sign_citation":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA/action/citation_signature","submit_replication":"https://pith.science/pith/DXKIMBMRPHUH7IUYJHL6M3AYZA/action/replication_record"}},"created_at":"2026-05-18T01:20:55.466679+00:00","updated_at":"2026-05-18T01:20:55.466679+00:00"}