{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3BNN3PEKLIZSSGDHHMBFUVPGDN","short_pith_number":"pith:3BNN3PEK","schema_version":"1.0","canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","source":{"kind":"arxiv","id":"1505.07515","version":2},"attestation_state":"computed","paper":{"title":"Communication Efficient Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Wentao Huang","submitted_at":"2015-05-28T00:12:03Z","abstract_excerpt":"A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the secret, and any set of at most $t_2 < t_1$ shares reveal no information about the secret. Assuming that each party holds a share and a user wishes to decode the secret by receiving information from a set of parties; the question we study is how to minimize the amount of communication between the user and the parties. We show that the necessary amount of communicat"},"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":"1505.07515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-28T00:12:03Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"242cc2156c99f753f1beae93727fa8ce83c6a02c5dfd61f05376406cf3bd65b4","abstract_canon_sha256":"79c1db0913d0a8f4209038e6a657f705c53b691afbe97b288d80d6fc9e745964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:55.523640Z","signature_b64":"8GZ+puv0NDlzkE4/xXnu+j0T6gkGNrDSgpt3uyujWmk4ESjdl6mrFtHIjoKJK30hlvFapeSo2/vWYYy55bNgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85addbc8a5a332918673b025a55e61b722b308fd26e8b46768ac15f45a8b740","last_reissued_at":"2026-05-18T01:17:55.522940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:55.522940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Efficient Secret Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Joerg Kliewer, Michael Langberg, Wentao Huang","submitted_at":"2015-05-28T00:12:03Z","abstract_excerpt":"A secret sharing scheme is a method to store information securely and reliably. Particularly, in a threshold secret sharing scheme, a secret is encoded into $n$ shares, such that any set of at least $t_1$ shares suffice to decode the secret, and any set of at most $t_2 < t_1$ shares reveal no information about the secret. Assuming that each party holds a share and a user wishes to decode the secret by receiving information from a set of parties; the question we study is how to minimize the amount of communication between the user and the parties. We show that the necessary amount of communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07515","kind":"arxiv","version":2},"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":"1505.07515","created_at":"2026-05-18T01:17:55.523051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07515v2","created_at":"2026-05-18T01:17:55.523051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07515","created_at":"2026-05-18T01:17:55.523051+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BNN3PEKLIZS","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BNN3PEKLIZSSGDH","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BNN3PEK","created_at":"2026-05-18T12:29:02.477457+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/3BNN3PEKLIZSSGDHHMBFUVPGDN","json":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN.json","graph_json":"https://pith.science/api/pith-number/3BNN3PEKLIZSSGDHHMBFUVPGDN/graph.json","events_json":"https://pith.science/api/pith-number/3BNN3PEKLIZSSGDHHMBFUVPGDN/events.json","paper":"https://pith.science/paper/3BNN3PEK"},"agent_actions":{"view_html":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN","download_json":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN.json","view_paper":"https://pith.science/paper/3BNN3PEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07515&json=true","fetch_graph":"https://pith.science/api/pith-number/3BNN3PEKLIZSSGDHHMBFUVPGDN/graph.json","fetch_events":"https://pith.science/api/pith-number/3BNN3PEKLIZSSGDHHMBFUVPGDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/action/storage_attestation","attest_author":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/action/author_attestation","sign_citation":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/action/citation_signature","submit_replication":"https://pith.science/pith/3BNN3PEKLIZSSGDHHMBFUVPGDN/action/replication_record"}},"created_at":"2026-05-18T01:17:55.523051+00:00","updated_at":"2026-05-18T01:17:55.523051+00:00"}