{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OGS5M5Z4E7R3RJRNBGLYPQWS5H","short_pith_number":"pith:OGS5M5Z4","schema_version":"1.0","canonical_sha256":"71a5d6773c27e3b8a62d099787c2d2e9e640d6a20995360fb9aa9080fe9f291f","source":{"kind":"arxiv","id":"1808.02974","version":3},"attestation_state":"computed","paper":{"title":"Secret Sharing with Binary Shares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Fuchun Lin, Huaxiong Wang, Mahdi Cheraghchi, Reihaneh Safavi-Naini, Venkatesan Guruswami","submitted_at":"2018-08-09T00:25:14Z","abstract_excerpt":"Shamir's celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length $\\ell$ among any $N \\leq 2^\\ell$ players such that for a threshold parameter $t$, (i) the knowledge of any $t$ shares does not reveal any information about the secret and, (ii) any choice of $t+1$ shares fully reveals the secret. It is known that any such threshold secret sharing scheme necessarily requires shares of length $\\ell$, and in this sense Shamir's scheme is optimal. The more general notion of ramp schemes requires the reconstruction of secret from any $t+g$ shares, for a "},"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":"1808.02974","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-08-09T00:25:14Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"b791da9fa27a42310197c0c4bc8878aa2dc1e6390e3eede76cc506650c5d2d91","abstract_canon_sha256":"ac1bfbbd77f94be0f238fdad04745ecabf51a0449738ca604d129bf7d038a714"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:24.862055Z","signature_b64":"iJSm3ttQ/bsFot93RAWuGkfV0Qn42WgJ1IWwdap5hf0Fshn0MZNfbJavBRgxMtCLD66fvO91tZ2l7U093IpPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a5d6773c27e3b8a62d099787c2d2e9e640d6a20995360fb9aa9080fe9f291f","last_reissued_at":"2026-05-17T23:58:24.861473Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:24.861473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret Sharing with Binary Shares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Fuchun Lin, Huaxiong Wang, Mahdi Cheraghchi, Reihaneh Safavi-Naini, Venkatesan Guruswami","submitted_at":"2018-08-09T00:25:14Z","abstract_excerpt":"Shamir's celebrated secret sharing scheme provides an efficient method for encoding a secret of arbitrary length $\\ell$ among any $N \\leq 2^\\ell$ players such that for a threshold parameter $t$, (i) the knowledge of any $t$ shares does not reveal any information about the secret and, (ii) any choice of $t+1$ shares fully reveals the secret. It is known that any such threshold secret sharing scheme necessarily requires shares of length $\\ell$, and in this sense Shamir's scheme is optimal. The more general notion of ramp schemes requires the reconstruction of secret from any $t+g$ shares, for a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02974","kind":"arxiv","version":3},"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":"1808.02974","created_at":"2026-05-17T23:58:24.861572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.02974v3","created_at":"2026-05-17T23:58:24.861572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02974","created_at":"2026-05-17T23:58:24.861572+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGS5M5Z4E7R3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGS5M5Z4E7R3RJRN","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGS5M5Z4","created_at":"2026-05-18T12:32:43.782077+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/OGS5M5Z4E7R3RJRNBGLYPQWS5H","json":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H.json","graph_json":"https://pith.science/api/pith-number/OGS5M5Z4E7R3RJRNBGLYPQWS5H/graph.json","events_json":"https://pith.science/api/pith-number/OGS5M5Z4E7R3RJRNBGLYPQWS5H/events.json","paper":"https://pith.science/paper/OGS5M5Z4"},"agent_actions":{"view_html":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H","download_json":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H.json","view_paper":"https://pith.science/paper/OGS5M5Z4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.02974&json=true","fetch_graph":"https://pith.science/api/pith-number/OGS5M5Z4E7R3RJRNBGLYPQWS5H/graph.json","fetch_events":"https://pith.science/api/pith-number/OGS5M5Z4E7R3RJRNBGLYPQWS5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H/action/storage_attestation","attest_author":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H/action/author_attestation","sign_citation":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H/action/citation_signature","submit_replication":"https://pith.science/pith/OGS5M5Z4E7R3RJRNBGLYPQWS5H/action/replication_record"}},"created_at":"2026-05-17T23:58:24.861572+00:00","updated_at":"2026-05-17T23:58:24.861572+00:00"}