{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DBN33QLMXWAOM2WOA77AIFEGW3","short_pith_number":"pith:DBN33QLM","schema_version":"1.0","canonical_sha256":"185bbdc16cbd80e66ace07fe041486b6c0da9ea050593b93dc3f1aff3a253d7e","source":{"kind":"arxiv","id":"2009.09090","version":3},"attestation_state":"computed","paper":{"title":"MIRAGE: Mitigating Conflict-Based Cache Attacks with a Practical Fully-Associative Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Gururaj Saileshwar, Moinuddin Qureshi","submitted_at":"2020-09-18T21:12:18Z","abstract_excerpt":"Shared processor caches are vulnerable to conflict-based side-channel attacks, where an attacker can monitor access patterns of a victim by evicting victim cache lines using cache-set conflicts. Recent mitigations propose randomized mapping of addresses to cache lines to obfuscate the locations of set-conflicts. However, these are vulnerable to new attacks that discover conflicting sets of addresses despite such mitigations, because these designs select eviction-candidates from a small set of conflicting lines.\n  This paper presents Mirage, a practical design for a fully associative cache, whe"},"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":"2009.09090","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-09-18T21:12:18Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"4cb959c741fd01658b8d4179b41b950066a351adee764ae8661e9ef8fede0848","abstract_canon_sha256":"af2bf77a6a460f7d1394323552d95ad71824e2c123d34676a0e5baf70f7b1e77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:25:50.210279Z","signature_b64":"4xLOJDHi6qWBD4oLIYUVv03baUKBQN5Z9cuZSOX2fqnjfd/cJjXeSj9/SqORqfCJJi3vo/bDz4Ya4Pxm3xj+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185bbdc16cbd80e66ace07fe041486b6c0da9ea050593b93dc3f1aff3a253d7e","last_reissued_at":"2026-07-05T02:25:50.209793Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:25:50.209793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MIRAGE: Mitigating Conflict-Based Cache Attacks with a Practical Fully-Associative Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CR","authors_text":"Gururaj Saileshwar, Moinuddin Qureshi","submitted_at":"2020-09-18T21:12:18Z","abstract_excerpt":"Shared processor caches are vulnerable to conflict-based side-channel attacks, where an attacker can monitor access patterns of a victim by evicting victim cache lines using cache-set conflicts. Recent mitigations propose randomized mapping of addresses to cache lines to obfuscate the locations of set-conflicts. However, these are vulnerable to new attacks that discover conflicting sets of addresses despite such mitigations, because these designs select eviction-candidates from a small set of conflicting lines.\n  This paper presents Mirage, a practical design for a fully associative cache, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.09090","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.09090/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.09090","created_at":"2026-07-05T02:25:50.209851+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.09090v3","created_at":"2026-07-05T02:25:50.209851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.09090","created_at":"2026-07-05T02:25:50.209851+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBN33QLMXWAO","created_at":"2026-07-05T02:25:50.209851+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBN33QLMXWAOM2WO","created_at":"2026-07-05T02:25:50.209851+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBN33QLM","created_at":"2026-07-05T02:25:50.209851+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10362","citing_title":"Relaxation-Free Min-k-Partition for PCI Assignment in 5G Networks","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3","json":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3.json","graph_json":"https://pith.science/api/pith-number/DBN33QLMXWAOM2WOA77AIFEGW3/graph.json","events_json":"https://pith.science/api/pith-number/DBN33QLMXWAOM2WOA77AIFEGW3/events.json","paper":"https://pith.science/paper/DBN33QLM"},"agent_actions":{"view_html":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3","download_json":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3.json","view_paper":"https://pith.science/paper/DBN33QLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.09090&json=true","fetch_graph":"https://pith.science/api/pith-number/DBN33QLMXWAOM2WOA77AIFEGW3/graph.json","fetch_events":"https://pith.science/api/pith-number/DBN33QLMXWAOM2WOA77AIFEGW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3/action/storage_attestation","attest_author":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3/action/author_attestation","sign_citation":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3/action/citation_signature","submit_replication":"https://pith.science/pith/DBN33QLMXWAOM2WOA77AIFEGW3/action/replication_record"}},"created_at":"2026-07-05T02:25:50.209851+00:00","updated_at":"2026-07-05T02:25:50.209851+00:00"}