{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DOQXRDYQ7QUOLBYB3BURPYWPUP","short_pith_number":"pith:DOQXRDYQ","schema_version":"1.0","canonical_sha256":"1ba1788f10fc28e58701d86917e2cfa3d7d0f66c8cd6561fd53ded26a57ce2a2","source":{"kind":"arxiv","id":"1902.00167","version":1},"attestation_state":"computed","paper":{"title":"Private Secure Coded Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jungwoo Lee, Minchul Kim","submitted_at":"2019-02-01T04:03:22Z","abstract_excerpt":"We introduce a variation of coded computation that ensures data security and master's privacy against workers, which is referred to as private secure coded computation. In private secure coded computation, the master needs to compute a function of its own dataset and one of the datasets in a library exclusively shared by external workers. After recovering the desired function, the workers must not be able to know which dataset in the library was desired by the master or obtain any information about the master's own data. We propose a private secure coded computation scheme for matrix multiplic"},"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":"1902.00167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-01T04:03:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"49f7716a7487bbdf0606bd4137639b17feef2e9e9d08776b8a70911225431962","abstract_canon_sha256":"72b974c38501d324ec302abeffe05fd237e52dfc5ec7ab5bc09e9d920dec0291"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.122379Z","signature_b64":"YfCsYj2H0YpkZD5ovry/aVjv7qbqPW0aYaS5PkZYqmAfQo5U2MyMmp1usBmLR9IkjwIb2AG/mciTiL9rcQvxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba1788f10fc28e58701d86917e2cfa3d7d0f66c8cd6561fd53ded26a57ce2a2","last_reissued_at":"2026-05-17T23:54:58.121874Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.121874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Secure Coded Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jungwoo Lee, Minchul Kim","submitted_at":"2019-02-01T04:03:22Z","abstract_excerpt":"We introduce a variation of coded computation that ensures data security and master's privacy against workers, which is referred to as private secure coded computation. In private secure coded computation, the master needs to compute a function of its own dataset and one of the datasets in a library exclusively shared by external workers. After recovering the desired function, the workers must not be able to know which dataset in the library was desired by the master or obtain any information about the master's own data. We propose a private secure coded computation scheme for matrix multiplic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00167","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":"1902.00167","created_at":"2026-05-17T23:54:58.121959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00167v1","created_at":"2026-05-17T23:54:58.121959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00167","created_at":"2026-05-17T23:54:58.121959+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOQXRDYQ7QUO","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOQXRDYQ7QUOLBYB","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOQXRDYQ","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10684","citing_title":"On the Upload versus Download Cost for Secure and Private Matrix Multiplication","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP","json":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP.json","graph_json":"https://pith.science/api/pith-number/DOQXRDYQ7QUOLBYB3BURPYWPUP/graph.json","events_json":"https://pith.science/api/pith-number/DOQXRDYQ7QUOLBYB3BURPYWPUP/events.json","paper":"https://pith.science/paper/DOQXRDYQ"},"agent_actions":{"view_html":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP","download_json":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP.json","view_paper":"https://pith.science/paper/DOQXRDYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00167&json=true","fetch_graph":"https://pith.science/api/pith-number/DOQXRDYQ7QUOLBYB3BURPYWPUP/graph.json","fetch_events":"https://pith.science/api/pith-number/DOQXRDYQ7QUOLBYB3BURPYWPUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP/action/storage_attestation","attest_author":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP/action/author_attestation","sign_citation":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP/action/citation_signature","submit_replication":"https://pith.science/pith/DOQXRDYQ7QUOLBYB3BURPYWPUP/action/replication_record"}},"created_at":"2026-05-17T23:54:58.121959+00:00","updated_at":"2026-05-17T23:54:58.121959+00:00"}