{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RZL4326Q4UASWGASL3HDUUF6EG","short_pith_number":"pith:RZL4326Q","schema_version":"1.0","canonical_sha256":"8e57cdebd0e5012b18125ece3a50be21b6f862ae83b0a2e2f596935ca6b35838","source":{"kind":"arxiv","id":"2303.08865","version":1},"attestation_state":"computed","paper":{"title":"Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Dominik Leichtle, Elham Kashefi, Harold Ollivier, Luka Music, Theodoros Kapourniotis","submitted_at":"2023-03-15T18:33:18Z","abstract_excerpt":"Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a composably and statistically secure way, even for a single honest party. Unlike previous quantum SMPC protocols, our proposal only requires very limited quantum resources from all but one party; it suffices that the weak parties, i.e. the clients, are able to prepare single-qubit states in the X-Y plane. The novel quantum SMPC protocol is constructed in a naturally"},"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":"2303.08865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-15T18:33:18Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"f4ff5dc88b7fd628efd85af9ab4e9bc4dbe94f6ae7089e9bddbc8d5a0d954bff","abstract_canon_sha256":"d4ac404a74f37d1040f844e55930d7b3d3ec602b9b0de387850e6d4dc0ec16ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:46.219846Z","signature_b64":"Mt9XRbDxZQRo87MVhVhxbdHN9HHN04Gkf+VThNV+NdwGdMayNxWtMYDdmGqF//sHfxp+nEbAcVqLHE+qz3RyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e57cdebd0e5012b18125ece3a50be21b6f862ae83b0a2e2f596935ca6b35838","last_reissued_at":"2026-07-05T05:51:46.219510Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:46.219510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymmetric Quantum Secure Multi-Party Computation With Weak Clients Against Dishonest Majority","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Dominik Leichtle, Elham Kashefi, Harold Ollivier, Luka Music, Theodoros Kapourniotis","submitted_at":"2023-03-15T18:33:18Z","abstract_excerpt":"Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a composably and statistically secure way, even for a single honest party. Unlike previous quantum SMPC protocols, our proposal only requires very limited quantum resources from all but one party; it suffices that the weak parties, i.e. the clients, are able to prepare single-qubit states in the X-Y plane. The novel quantum SMPC protocol is constructed in a naturally"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.08865","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.08865/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.08865","created_at":"2026-07-05T05:51:46.219565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.08865v1","created_at":"2026-07-05T05:51:46.219565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.08865","created_at":"2026-07-05T05:51:46.219565+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZL4326Q4UAS","created_at":"2026-07-05T05:51:46.219565+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZL4326Q4UASWGAS","created_at":"2026-07-05T05:51:46.219565+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZL4326Q","created_at":"2026-07-05T05:51:46.219565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05650","citing_title":"Verifiable blind quantum computing: Comparative analysis and design considerations for client architectures","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG","json":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG.json","graph_json":"https://pith.science/api/pith-number/RZL4326Q4UASWGASL3HDUUF6EG/graph.json","events_json":"https://pith.science/api/pith-number/RZL4326Q4UASWGASL3HDUUF6EG/events.json","paper":"https://pith.science/paper/RZL4326Q"},"agent_actions":{"view_html":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG","download_json":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG.json","view_paper":"https://pith.science/paper/RZL4326Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.08865&json=true","fetch_graph":"https://pith.science/api/pith-number/RZL4326Q4UASWGASL3HDUUF6EG/graph.json","fetch_events":"https://pith.science/api/pith-number/RZL4326Q4UASWGASL3HDUUF6EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG/action/storage_attestation","attest_author":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG/action/author_attestation","sign_citation":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG/action/citation_signature","submit_replication":"https://pith.science/pith/RZL4326Q4UASWGASL3HDUUF6EG/action/replication_record"}},"created_at":"2026-07-05T05:51:46.219565+00:00","updated_at":"2026-07-05T05:51:46.219565+00:00"}