{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ROPXNWPQRKSNFLCTIV2ZAHTTJE","short_pith_number":"pith:ROPXNWPQ","schema_version":"1.0","canonical_sha256":"8b9f76d9f08aa4d2ac534575901e7349102a6a07d837a5a83faa723bcf564fd1","source":{"kind":"arxiv","id":"1508.07690","version":5},"attestation_state":"computed","paper":{"title":"Secure Multi-Party Computation with a Helper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Johannes Schneider","submitted_at":"2015-08-31T05:36:56Z","abstract_excerpt":"A client wishes to outsource computation on confidential data to a network of parties. He does not trust a single party but believes that multiple parties do not collude. To solve this problem, we use the idea of treating one of the parties as a helper. A helper assists computation only. Often using more parties ensures confidentiality despite more corrupted parties. This does not hold for adding a helper. But a helper can in some cases lower the amount of communication asymptotically to the theoretical minimum of one bit per AND gate, improving significantly on schemes without a helper. It ca"},"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":"1508.07690","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-08-31T05:36:56Z","cross_cats_sorted":[],"title_canon_sha256":"b81e05b33c8cd7ffa30c4ede05a15305a81a704ec2b7d02159ada67b858d0d3e","abstract_canon_sha256":"31aba878b68152a0e5080fe02bc606ec077e74e1fdae9598470637a107b6e147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.101313Z","signature_b64":"Z3iQ1Z112gA3Mv62poHs24syWsW5HZS/ivmBVlhii04ku5pc4y9OlvJ+7lRTbsmq6quF46ke1AJQ63h0dIreDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b9f76d9f08aa4d2ac534575901e7349102a6a07d837a5a83faa723bcf564fd1","last_reissued_at":"2026-05-18T00:39:57.100870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.100870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Multi-Party Computation with a Helper","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Johannes Schneider","submitted_at":"2015-08-31T05:36:56Z","abstract_excerpt":"A client wishes to outsource computation on confidential data to a network of parties. He does not trust a single party but believes that multiple parties do not collude. To solve this problem, we use the idea of treating one of the parties as a helper. A helper assists computation only. Often using more parties ensures confidentiality despite more corrupted parties. This does not hold for adding a helper. But a helper can in some cases lower the amount of communication asymptotically to the theoretical minimum of one bit per AND gate, improving significantly on schemes without a helper. It ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07690","kind":"arxiv","version":5},"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":"1508.07690","created_at":"2026-05-18T00:39:57.100933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07690v5","created_at":"2026-05-18T00:39:57.100933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07690","created_at":"2026-05-18T00:39:57.100933+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROPXNWPQRKSN","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROPXNWPQRKSNFLCT","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROPXNWPQ","created_at":"2026-05-18T12:29:39.896362+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/ROPXNWPQRKSNFLCTIV2ZAHTTJE","json":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE.json","graph_json":"https://pith.science/api/pith-number/ROPXNWPQRKSNFLCTIV2ZAHTTJE/graph.json","events_json":"https://pith.science/api/pith-number/ROPXNWPQRKSNFLCTIV2ZAHTTJE/events.json","paper":"https://pith.science/paper/ROPXNWPQ"},"agent_actions":{"view_html":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE","download_json":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE.json","view_paper":"https://pith.science/paper/ROPXNWPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07690&json=true","fetch_graph":"https://pith.science/api/pith-number/ROPXNWPQRKSNFLCTIV2ZAHTTJE/graph.json","fetch_events":"https://pith.science/api/pith-number/ROPXNWPQRKSNFLCTIV2ZAHTTJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE/action/storage_attestation","attest_author":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE/action/author_attestation","sign_citation":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE/action/citation_signature","submit_replication":"https://pith.science/pith/ROPXNWPQRKSNFLCTIV2ZAHTTJE/action/replication_record"}},"created_at":"2026-05-18T00:39:57.100933+00:00","updated_at":"2026-05-18T00:39:57.100933+00:00"}