{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OB63CBMBOVHWAON2WAQJIYS7LK","short_pith_number":"pith:OB63CBMB","schema_version":"1.0","canonical_sha256":"707db10581754f6039bab02094625f5a896ec6604d427f1aaa456666da8f9785","source":{"kind":"arxiv","id":"1105.4125","version":1},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Michael Mitzenmacher, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","submitted_at":"2011-05-20T16:32:19Z","abstract_excerpt":"We study the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users. We show that such privacy-preserving data access is possible using a combination of probabilistic encryption, which directly hides data values, and stateless oblivious RAM simulation, which hides the pattern of data accesses. We give simulations that have only an $O(\\log n)$ amortized time overhead for simulating a RAM algorithm, $\\cal A$, that has a memory of size $n$, using a scheme that is data-oblivious with very high probability assuming the simulat"},"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":"1105.4125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-05-20T16:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"4714158793b70c70affc5db2b7123e833dc9115beb0ad64e7ef942dc0090bb1c","abstract_canon_sha256":"f98cbfae73d62fbd5d9f192912b39b72c358e68fc3e5742c0e2c148a160dd381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:42.886252Z","signature_b64":"zoXyGaVzpjYwwUpnULRabIdySpN3Ybb4iDWxwip38SlzI72uOWLUH8y6f/uYZCULexPE0mZlGuDxRx8l4np5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"707db10581754f6039bab02094625f5a896ec6604d427f1aaa456666da8f9785","last_reissued_at":"2026-05-18T04:21:42.885779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:42.885779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Group Data Access via Stateless Oblivious RAM Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Michael Mitzenmacher, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","submitted_at":"2011-05-20T16:32:19Z","abstract_excerpt":"We study the problem of providing privacy-preserving access to an outsourced honest-but-curious data repository for a group of trusted users. We show that such privacy-preserving data access is possible using a combination of probabilistic encryption, which directly hides data values, and stateless oblivious RAM simulation, which hides the pattern of data accesses. We give simulations that have only an $O(\\log n)$ amortized time overhead for simulating a RAM algorithm, $\\cal A$, that has a memory of size $n$, using a scheme that is data-oblivious with very high probability assuming the simulat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.4125","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":"1105.4125","created_at":"2026-05-18T04:21:42.885857+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.4125v1","created_at":"2026-05-18T04:21:42.885857+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.4125","created_at":"2026-05-18T04:21:42.885857+00:00"},{"alias_kind":"pith_short_12","alias_value":"OB63CBMBOVHW","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OB63CBMBOVHWAON2","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OB63CBMB","created_at":"2026-05-18T12:26:37.096874+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/OB63CBMBOVHWAON2WAQJIYS7LK","json":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK.json","graph_json":"https://pith.science/api/pith-number/OB63CBMBOVHWAON2WAQJIYS7LK/graph.json","events_json":"https://pith.science/api/pith-number/OB63CBMBOVHWAON2WAQJIYS7LK/events.json","paper":"https://pith.science/paper/OB63CBMB"},"agent_actions":{"view_html":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK","download_json":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK.json","view_paper":"https://pith.science/paper/OB63CBMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.4125&json=true","fetch_graph":"https://pith.science/api/pith-number/OB63CBMBOVHWAON2WAQJIYS7LK/graph.json","fetch_events":"https://pith.science/api/pith-number/OB63CBMBOVHWAON2WAQJIYS7LK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK/action/storage_attestation","attest_author":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK/action/author_attestation","sign_citation":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK/action/citation_signature","submit_replication":"https://pith.science/pith/OB63CBMBOVHWAON2WAQJIYS7LK/action/replication_record"}},"created_at":"2026-05-18T04:21:42.885857+00:00","updated_at":"2026-05-18T04:21:42.885857+00:00"}