{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UE4NFTAZSI3TXYZXGJH2SDSXCR","short_pith_number":"pith:UE4NFTAZ","schema_version":"1.0","canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","source":{"kind":"arxiv","id":"1110.1851","version":1},"attestation_state":"computed","paper":{"title":"Oblivious Storage with Low I/O Overhead","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-10-09T15:47:33Z","abstract_excerpt":"We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with "},"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":"1110.1851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"5abfb54fa84904b603084727b376d3d6464d4e32355d3e07e915c97b9661443c","abstract_canon_sha256":"223d4fd4d840b5ecf47e818b02c5eadaf9eaa2f9a84aba35ad0ab5999ae30002"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.522155Z","signature_b64":"NK2VFNmzDg81EgVzBVD4uQCM6vp9t8K7cj2LlteXLG2C/X6M5lo0y0Hh9RrqyiX57iii56FIZquXkRsugQ9BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","last_reissued_at":"2026-05-18T04:11:19.521407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.521407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oblivious Storage with Low I/O Overhead","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-10-09T15:47:33Z","abstract_excerpt":"We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1851","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":"1110.1851","created_at":"2026-05-18T04:11:19.521505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1851v1","created_at":"2026-05-18T04:11:19.521505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1851","created_at":"2026-05-18T04:11:19.521505+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE4NFTAZSI3T","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE4NFTAZSI3TXYZX","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE4NFTAZ","created_at":"2026-05-18T12:26:42.757692+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/UE4NFTAZSI3TXYZXGJH2SDSXCR","json":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR.json","graph_json":"https://pith.science/api/pith-number/UE4NFTAZSI3TXYZXGJH2SDSXCR/graph.json","events_json":"https://pith.science/api/pith-number/UE4NFTAZSI3TXYZXGJH2SDSXCR/events.json","paper":"https://pith.science/paper/UE4NFTAZ"},"agent_actions":{"view_html":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR","download_json":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR.json","view_paper":"https://pith.science/paper/UE4NFTAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1851&json=true","fetch_graph":"https://pith.science/api/pith-number/UE4NFTAZSI3TXYZXGJH2SDSXCR/graph.json","fetch_events":"https://pith.science/api/pith-number/UE4NFTAZSI3TXYZXGJH2SDSXCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/action/storage_attestation","attest_author":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/action/author_attestation","sign_citation":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/action/citation_signature","submit_replication":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/action/replication_record"}},"created_at":"2026-05-18T04:11:19.521505+00:00","updated_at":"2026-05-18T04:11:19.521505+00:00"}