{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FZTJ3XRL3LE77HLZZB2RISUPJH","short_pith_number":"pith:FZTJ3XRL","schema_version":"1.0","canonical_sha256":"2e669dde2bdac9ff9d79c875144a8f49e114181f6f84c8139d87754051f9442f","source":{"kind":"arxiv","id":"1505.07391","version":2},"attestation_state":"computed","paper":{"title":"A Practical Oblivious Map Data Structure with Secure Deletion and History Independence","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Adam J. Aviv, Daniel S. Roche, Seung Geol Choi","submitted_at":"2015-05-27T16:08:34Z","abstract_excerpt":"We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding. We also present a new history-independent data structure (a HIRB tree) that can be stored within a vORAM. Together, this construction provides an efficient and practical oblivious data structure (ODS) for a key/value map, and goes further to provide an additional privacy guarantee as compared to prior ODS maps: even upon client compromise, deleted data and the history of old operations remain hidden to the attacker.\n  We implement and"},"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":"1505.07391","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CR","submitted_at":"2015-05-27T16:08:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c2e426b3cd1c819e3ca53f726097f252bdf2093628339a31851b341ae9d1760","abstract_canon_sha256":"c717d791bd4d2d84b47d33c168c36913abe2da06dd082ee92eaf0ee3f2d68d20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:25.291439Z","signature_b64":"wzugfUpWKgPHq4kbGrSklhDRHGpvlJ2964/IG7mIMC5NobFJ0M6iukXolucLHGIqGh0AHcbYqoIrNe5Re+4IAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e669dde2bdac9ff9d79c875144a8f49e114181f6f84c8139d87754051f9442f","last_reissued_at":"2026-05-18T01:26:25.290886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:25.290886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical Oblivious Map Data Structure with Secure Deletion and History Independence","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Adam J. Aviv, Daniel S. Roche, Seung Geol Choi","submitted_at":"2015-05-27T16:08:34Z","abstract_excerpt":"We present a new oblivious RAM that supports variable-sized storage blocks (vORAM), which is the first ORAM to allow varying block sizes without trivial padding. We also present a new history-independent data structure (a HIRB tree) that can be stored within a vORAM. Together, this construction provides an efficient and practical oblivious data structure (ODS) for a key/value map, and goes further to provide an additional privacy guarantee as compared to prior ODS maps: even upon client compromise, deleted data and the history of old operations remain hidden to the attacker.\n  We implement and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07391","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":"1505.07391","created_at":"2026-05-18T01:26:25.290972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07391v2","created_at":"2026-05-18T01:26:25.290972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07391","created_at":"2026-05-18T01:26:25.290972+00:00"},{"alias_kind":"pith_short_12","alias_value":"FZTJ3XRL3LE7","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FZTJ3XRL3LE77HLZ","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FZTJ3XRL","created_at":"2026-05-18T12:29:22.688609+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/FZTJ3XRL3LE77HLZZB2RISUPJH","json":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH.json","graph_json":"https://pith.science/api/pith-number/FZTJ3XRL3LE77HLZZB2RISUPJH/graph.json","events_json":"https://pith.science/api/pith-number/FZTJ3XRL3LE77HLZZB2RISUPJH/events.json","paper":"https://pith.science/paper/FZTJ3XRL"},"agent_actions":{"view_html":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH","download_json":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH.json","view_paper":"https://pith.science/paper/FZTJ3XRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07391&json=true","fetch_graph":"https://pith.science/api/pith-number/FZTJ3XRL3LE77HLZZB2RISUPJH/graph.json","fetch_events":"https://pith.science/api/pith-number/FZTJ3XRL3LE77HLZZB2RISUPJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH/action/storage_attestation","attest_author":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH/action/author_attestation","sign_citation":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH/action/citation_signature","submit_replication":"https://pith.science/pith/FZTJ3XRL3LE77HLZZB2RISUPJH/action/replication_record"}},"created_at":"2026-05-18T01:26:25.290972+00:00","updated_at":"2026-05-18T01:26:25.290972+00:00"}