{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3IS2Z2N6F6W4UANZLBIW2ZNBS4","short_pith_number":"pith:3IS2Z2N6","schema_version":"1.0","canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","source":{"kind":"arxiv","id":"1403.5698","version":3},"attestation_state":"computed","paper":{"title":"Secret-Sharing for NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Eylon Yogev, Ilan Komargodski, Moni Naor","submitted_at":"2014-03-22T19:11:09Z","abstract_excerpt":"A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a \"qualified\" subset of parties can efficiently reconstruct the secret while any \"unqualified\" subset of parties cannot efficiently learn anything about the secret. The collection of \"qualified\" subsets is defined by a Boolean function.\n  It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing schemes. Yao suggested a method for secret-sharing for any function that has a polynom"},"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":"1403.5698","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-03-22T19:11:09Z","cross_cats_sorted":[],"title_canon_sha256":"057d15aeb109025dd43c6250e774a644f61b4d1d19ea8136994c710adddc3984","abstract_canon_sha256":"ad357f27627367b00e823f62e5b343a98e3c29eac40c80bbdb59445faa9e004d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:58.732429Z","signature_b64":"4RxqGSoH59cMTdlEuiPUohMi9ACqVe2b0mlFeWCwUIAhirA7Q4w1eDil29oJ4wu2zg8AyImzO37Oop6lo9Y4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da25ace9be2fadca01b958516d65a197306b29076edfc1ba826f3099a34d9e0f","last_reissued_at":"2026-05-18T01:59:58.731884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:58.731884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secret-Sharing for NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Eylon Yogev, Ilan Komargodski, Moni Naor","submitted_at":"2014-03-22T19:11:09Z","abstract_excerpt":"A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a \"qualified\" subset of parties can efficiently reconstruct the secret while any \"unqualified\" subset of parties cannot efficiently learn anything about the secret. The collection of \"qualified\" subsets is defined by a Boolean function.\n  It has been a major open problem to understand which (monotone) functions can be realized by a computational secret-sharing schemes. Yao suggested a method for secret-sharing for any function that has a polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5698","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":"1403.5698","created_at":"2026-05-18T01:59:58.731964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5698v3","created_at":"2026-05-18T01:59:58.731964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5698","created_at":"2026-05-18T01:59:58.731964+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IS2Z2N6F6W4","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IS2Z2N6F6W4UANZ","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IS2Z2N6","created_at":"2026-05-18T12:28:11.866339+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/3IS2Z2N6F6W4UANZLBIW2ZNBS4","json":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4.json","graph_json":"https://pith.science/api/pith-number/3IS2Z2N6F6W4UANZLBIW2ZNBS4/graph.json","events_json":"https://pith.science/api/pith-number/3IS2Z2N6F6W4UANZLBIW2ZNBS4/events.json","paper":"https://pith.science/paper/3IS2Z2N6"},"agent_actions":{"view_html":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4","download_json":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4.json","view_paper":"https://pith.science/paper/3IS2Z2N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5698&json=true","fetch_graph":"https://pith.science/api/pith-number/3IS2Z2N6F6W4UANZLBIW2ZNBS4/graph.json","fetch_events":"https://pith.science/api/pith-number/3IS2Z2N6F6W4UANZLBIW2ZNBS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/action/storage_attestation","attest_author":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/action/author_attestation","sign_citation":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/action/citation_signature","submit_replication":"https://pith.science/pith/3IS2Z2N6F6W4UANZLBIW2ZNBS4/action/replication_record"}},"created_at":"2026-05-18T01:59:58.731964+00:00","updated_at":"2026-05-18T01:59:58.731964+00:00"}