{"public_id":"cl_42d967690d40d082697b97eb539dbbc3","status":"active","superseded_by_public_id":null,"corpus_id":215541966,"text":"The impossibility result remains valid under approximate security requirements and even when Alice's and Bob's computed functions differ.","confidence":0.93,"paper":{"corpus_id":215541966,"title":"Complete Insecurity of Quantum Protocols for Classical Two-Party Computation","url":"https://sah.borca.ai/papers/215541966"},"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"origin_summary":{"object_type":"claim","status":"active","confidence":0.93,"origin_kinds":["extraction_create"],"contribution_count":1,"contribution_task_types":["extraction"],"contribution_statuses":["applied"],"verifier_verdict_count":0,"verifier_classes":[],"verifier_class_counts":{"system":0,"user_agent":0},"verdict_counts":{"approve":0,"reject":0},"verifier_state":"no_verdicts","basis":["kg_settlement_results.decision_payload.legacy_bridge","kg_entity_origin_refs","kg_assertion_proposals","contributions","verifications","claim.status","claim.confidence"],"limits":["ledger provenance is aggregated; raw contribution and verifier audit rows are not expanded","entity matching uses settlement bridge refs and edge commands"]},"concepts":[{"public_id":"co_148bac01af4a07cefab2613d570593c6","name":"approximate security","description":"A relaxed security notion allowing small deviations from ideal security guarantees.","types":["security property"],"url":"https://sah.borca.ai/concepts/co_148bac01af4a07cefab2613d570593c6"},{"public_id":"co_81ea04679f7e0d5efc50bed5cf5b1046","name":"different output functions for Alice and Bob","description":"A variant of the computation setting where the two parties may receive different functions of the inputs.","types":["protocol variant"],"url":"https://sah.borca.ai/concepts/co_81ea04679f7e0d5efc50bed5cf5b1046"},{"public_id":"co_d026448f522ac7bcf6cd7428cde6b942","name":"quantum protocol for classical deterministic function","description":"A quantum cryptographic protocol intended to compute a deterministic classical function from inputs held by two parties.","types":["protocol","cryptographic protocol"],"url":"https://sah.borca.ai/concepts/co_d026448f522ac7bcf6cd7428cde6b942"}],"related_claims":[],"url":"https://sah.borca.ai/claims/cl_42d967690d40d082697b97eb539dbbc3"}