{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BKFG2UR3XZYSC4WIKQO2WTKLNQ","short_pith_number":"pith:BKFG2UR3","schema_version":"1.0","canonical_sha256":"0a8a6d523bbe712172c8541dab4d4b6c11e5fe76fdc2063f35cdbfcc65885a2e","source":{"kind":"arxiv","id":"1712.00735","version":1},"attestation_state":"computed","paper":{"title":"Fourier-based Function Secret Sharing with General Access Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Takeshi Koshiba","submitted_at":"2017-12-03T09:34:31Z","abstract_excerpt":"Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2^n and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have "},"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":"1712.00735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-12-03T09:34:31Z","cross_cats_sorted":[],"title_canon_sha256":"48c07ab7004605c1fad2276b1894eff56174a8796619c44ca35038e96f066bc2","abstract_canon_sha256":"93fffbd28b8351df23a59c1109ce7784c4e8716fb32d9cf64a0e78762f6bab57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:00.543218Z","signature_b64":"k3D5t/8Hyn/SXvxIVubyO/EqHyn03B8tbUt8hNh1yAHAcJASkblSXhN0BiTiWFOpcpR7TfllTCPRIbdmsxkaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a8a6d523bbe712172c8541dab4d4b6c11e5fe76fdc2063f35cdbfcc65885a2e","last_reissued_at":"2026-05-18T00:29:00.542595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:00.542595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fourier-based Function Secret Sharing with General Access Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Takeshi Koshiba","submitted_at":"2017-12-03T09:34:31Z","abstract_excerpt":"Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2^n and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00735","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":"1712.00735","created_at":"2026-05-18T00:29:00.542691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00735v1","created_at":"2026-05-18T00:29:00.542691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00735","created_at":"2026-05-18T00:29:00.542691+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKFG2UR3XZYS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKFG2UR3XZYSC4WI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKFG2UR3","created_at":"2026-05-18T12:31:08.081275+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/BKFG2UR3XZYSC4WIKQO2WTKLNQ","json":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ.json","graph_json":"https://pith.science/api/pith-number/BKFG2UR3XZYSC4WIKQO2WTKLNQ/graph.json","events_json":"https://pith.science/api/pith-number/BKFG2UR3XZYSC4WIKQO2WTKLNQ/events.json","paper":"https://pith.science/paper/BKFG2UR3"},"agent_actions":{"view_html":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ","download_json":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ.json","view_paper":"https://pith.science/paper/BKFG2UR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00735&json=true","fetch_graph":"https://pith.science/api/pith-number/BKFG2UR3XZYSC4WIKQO2WTKLNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BKFG2UR3XZYSC4WIKQO2WTKLNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ/action/storage_attestation","attest_author":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ/action/author_attestation","sign_citation":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ/action/citation_signature","submit_replication":"https://pith.science/pith/BKFG2UR3XZYSC4WIKQO2WTKLNQ/action/replication_record"}},"created_at":"2026-05-18T00:29:00.542691+00:00","updated_at":"2026-05-18T00:29:00.542691+00:00"}