{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KCWTCNKV56BPK3R3FLZHACWQ7O","short_pith_number":"pith:KCWTCNKV","schema_version":"1.0","canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","source":{"kind":"arxiv","id":"1809.00825","version":1},"attestation_state":"computed","paper":{"title":"More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Antigoni Polychroniadou, Elaine Shi, Jonathan Katz, Kartik Nayak, T-H. Hubert Chan","submitted_at":"2018-09-04T07:59:35Z","abstract_excerpt":"The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case.\n  In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first"},"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":"1809.00825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"2f15895218df5f82b26f395cfd63448e49c81630ce0ba835d87260f7ba2ef07e","abstract_canon_sha256":"f3b9e4a7ddd647f83a740130d58021aa3fa315b499cda1112e2b743a486b3e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.408302Z","signature_b64":"Dek8cz+M4MtyUFvP9163WN6Kw/quDazfl85RKBT4UI+kfBYsec09o1zveAEKHW4TWbq7KQ09H5+R1fPxMpjSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","last_reissued_at":"2026-05-18T00:06:32.407900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.407900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Antigoni Polychroniadou, Elaine Shi, Jonathan Katz, Kartik Nayak, T-H. Hubert Chan","submitted_at":"2018-09-04T07:59:35Z","abstract_excerpt":"The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case.\n  In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00825","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":"1809.00825","created_at":"2026-05-18T00:06:32.407967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00825v1","created_at":"2026-05-18T00:06:32.407967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00825","created_at":"2026-05-18T00:06:32.407967+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCWTCNKV56BP","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCWTCNKV56BPK3R3","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCWTCNKV","created_at":"2026-05-18T12:32:33.847187+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/KCWTCNKV56BPK3R3FLZHACWQ7O","json":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O.json","graph_json":"https://pith.science/api/pith-number/KCWTCNKV56BPK3R3FLZHACWQ7O/graph.json","events_json":"https://pith.science/api/pith-number/KCWTCNKV56BPK3R3FLZHACWQ7O/events.json","paper":"https://pith.science/paper/KCWTCNKV"},"agent_actions":{"view_html":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O","download_json":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O.json","view_paper":"https://pith.science/paper/KCWTCNKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00825&json=true","fetch_graph":"https://pith.science/api/pith-number/KCWTCNKV56BPK3R3FLZHACWQ7O/graph.json","fetch_events":"https://pith.science/api/pith-number/KCWTCNKV56BPK3R3FLZHACWQ7O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/action/storage_attestation","attest_author":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/action/author_attestation","sign_citation":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/action/citation_signature","submit_replication":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/action/replication_record"}},"created_at":"2026-05-18T00:06:32.407967+00:00","updated_at":"2026-05-18T00:06:32.407967+00:00"}