{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ETRST22KU3YLSNZC2Q4OCK34EV","short_pith_number":"pith:ETRST22K","schema_version":"1.0","canonical_sha256":"24e329eb4aa6f0b93722d438e12b7c2560c6f6d17212ed6e2a4cb05fbe9bef6c","source":{"kind":"arxiv","id":"1305.1146","version":1},"attestation_state":"computed","paper":{"title":"How to Collaborate between Threshold Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"DaoShun Wang, Xiaobo Li, Ziwei Ye","submitted_at":"2013-05-06T10:42:38Z","abstract_excerpt":"Threshold schemes have been used to protect secrets by distributing shares to participants. To protect two secrets, we can use two separate traditional schemes, say, a (t1, n1) scheme and a (t2, n2) scheme. If there are u (<=min(t1, t2)) participants involved in both schemes, each of these u participants must keep two different shares. This paper proposes a method that allows each common participant to keep only one share. Our method constructs two polynomials with u common crossover points. We give theoretical details and two demonstrative examples. This algorithm can also handle the collabor"},"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":"1305.1146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-06T10:42:38Z","cross_cats_sorted":[],"title_canon_sha256":"39935c471e1f862a87e26f424f355986836965716385d4af3d92eb3806b45338","abstract_canon_sha256":"3d9a8d5819564a583d65a9f7da5646505d541a64a91036e271915d9519a21520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:23.977752Z","signature_b64":"mWyxFKVG57JckjblZJ93v5e0E+vcEGZBi7RCs3Ibft11dXrW2nKzZd0MnzdHvh9ZBQ4ZgHAWdDJVHSpAxZcVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24e329eb4aa6f0b93722d438e12b7c2560c6f6d17212ed6e2a4cb05fbe9bef6c","last_reissued_at":"2026-05-18T03:26:23.977102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:23.977102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Collaborate between Threshold Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"DaoShun Wang, Xiaobo Li, Ziwei Ye","submitted_at":"2013-05-06T10:42:38Z","abstract_excerpt":"Threshold schemes have been used to protect secrets by distributing shares to participants. To protect two secrets, we can use two separate traditional schemes, say, a (t1, n1) scheme and a (t2, n2) scheme. If there are u (<=min(t1, t2)) participants involved in both schemes, each of these u participants must keep two different shares. This paper proposes a method that allows each common participant to keep only one share. Our method constructs two polynomials with u common crossover points. We give theoretical details and two demonstrative examples. This algorithm can also handle the collabor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1146","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":"1305.1146","created_at":"2026-05-18T03:26:23.977200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1146v1","created_at":"2026-05-18T03:26:23.977200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1146","created_at":"2026-05-18T03:26:23.977200+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETRST22KU3YL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETRST22KU3YLSNZC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETRST22K","created_at":"2026-05-18T12:27:43.054852+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/ETRST22KU3YLSNZC2Q4OCK34EV","json":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV.json","graph_json":"https://pith.science/api/pith-number/ETRST22KU3YLSNZC2Q4OCK34EV/graph.json","events_json":"https://pith.science/api/pith-number/ETRST22KU3YLSNZC2Q4OCK34EV/events.json","paper":"https://pith.science/paper/ETRST22K"},"agent_actions":{"view_html":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV","download_json":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV.json","view_paper":"https://pith.science/paper/ETRST22K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1146&json=true","fetch_graph":"https://pith.science/api/pith-number/ETRST22KU3YLSNZC2Q4OCK34EV/graph.json","fetch_events":"https://pith.science/api/pith-number/ETRST22KU3YLSNZC2Q4OCK34EV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV/action/storage_attestation","attest_author":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV/action/author_attestation","sign_citation":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV/action/citation_signature","submit_replication":"https://pith.science/pith/ETRST22KU3YLSNZC2Q4OCK34EV/action/replication_record"}},"created_at":"2026-05-18T03:26:23.977200+00:00","updated_at":"2026-05-18T03:26:23.977200+00:00"}