{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4KHGE5TZU4JPDHAQUACEULRAPZ","short_pith_number":"pith:4KHGE5TZ","schema_version":"1.0","canonical_sha256":"e28e627679a712f19c10a0044a2e207e703c51a85392151417d8136693d12029","source":{"kind":"arxiv","id":"1605.02646","version":1},"attestation_state":"computed","paper":{"title":"Information Theoretically Secure Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Gregory Valiant, Paul Valiant","submitted_at":"2016-05-09T16:18:48Z","abstract_excerpt":"We introduce the notion of a database system that is information theoretically \"Secure In Between Accesses\"--a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user's information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are realized. We stress that the security guarantee is information theoretic and everlasting: it relies neither on unproved hardness assumptions, nor on the assumption that the adversary is computationally"},"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":"1605.02646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-05-09T16:18:48Z","cross_cats_sorted":[],"title_canon_sha256":"26c118d91c319bdfbe73f6c9910b186b7ecdc3c41556252552a0a193074e60d2","abstract_canon_sha256":"c25af1ef0b1e617f9808fcbb1c66af6ad41cfcfa5f5c7a16dfad1db9894e59ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:15.945692Z","signature_b64":"7eRxOlXZctn3ZMg3rFveWa7XcrzXZ/5+wEwB0BHnU2iuDSYB+2oav8++fcUO73PKljGN8M9qHaDu6RqJCYuAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28e627679a712f19c10a0044a2e207e703c51a85392151417d8136693d12029","last_reissued_at":"2026-05-18T01:15:15.945138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:15.945138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Theoretically Secure Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Gregory Valiant, Paul Valiant","submitted_at":"2016-05-09T16:18:48Z","abstract_excerpt":"We introduce the notion of a database system that is information theoretically \"Secure In Between Accesses\"--a database system with the properties that 1) users can efficiently access their data, and 2) while a user is not accessing their data, the user's information is information theoretically secure to malicious agents, provided that certain requirements on the maintenance of the database are realized. We stress that the security guarantee is information theoretic and everlasting: it relies neither on unproved hardness assumptions, nor on the assumption that the adversary is computationally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02646","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":"1605.02646","created_at":"2026-05-18T01:15:15.945217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02646v1","created_at":"2026-05-18T01:15:15.945217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02646","created_at":"2026-05-18T01:15:15.945217+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KHGE5TZU4JP","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KHGE5TZU4JPDHAQ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KHGE5TZ","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09834","citing_title":"Optimal $k$-Secretary with Logarithmic Memory","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ","json":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ.json","graph_json":"https://pith.science/api/pith-number/4KHGE5TZU4JPDHAQUACEULRAPZ/graph.json","events_json":"https://pith.science/api/pith-number/4KHGE5TZU4JPDHAQUACEULRAPZ/events.json","paper":"https://pith.science/paper/4KHGE5TZ"},"agent_actions":{"view_html":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ","download_json":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ.json","view_paper":"https://pith.science/paper/4KHGE5TZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02646&json=true","fetch_graph":"https://pith.science/api/pith-number/4KHGE5TZU4JPDHAQUACEULRAPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4KHGE5TZU4JPDHAQUACEULRAPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ/action/storage_attestation","attest_author":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ/action/author_attestation","sign_citation":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ/action/citation_signature","submit_replication":"https://pith.science/pith/4KHGE5TZU4JPDHAQUACEULRAPZ/action/replication_record"}},"created_at":"2026-05-18T01:15:15.945217+00:00","updated_at":"2026-05-18T01:15:15.945217+00:00"}