{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:V6DOKHSEADXB5LCC2HC4VRLQGA","short_pith_number":"pith:V6DOKHSE","canonical_record":{"source":{"id":"1304.5087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-18T11:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"c29554bfab7a3dadcd0fb24a6a2c9e0c36ca0b8586c582529b26ecab1e7bfb58","abstract_canon_sha256":"809512b5a093fbe41eb70ce5c55bc8a209585e23b507859cfaeda9fdd436dd69"},"schema_version":"1.0"},"canonical_sha256":"af86e51e4400ee1eac42d1c5cac5703005605302a5b7a149212d94b9fb7c6aec","source":{"kind":"arxiv","id":"1304.5087","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5087","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5087v4","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5087","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"pith_short_12","alias_value":"V6DOKHSEADXB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V6DOKHSEADXB5LCC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V6DOKHSE","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:V6DOKHSEADXB5LCC2HC4VRLQGA","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-18T11:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"c29554bfab7a3dadcd0fb24a6a2c9e0c36ca0b8586c582529b26ecab1e7bfb58","abstract_canon_sha256":"809512b5a093fbe41eb70ce5c55bc8a209585e23b507859cfaeda9fdd436dd69"},"schema_version":"1.0"},"canonical_sha256":"af86e51e4400ee1eac42d1c5cac5703005605302a5b7a149212d94b9fb7c6aec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:32.349075Z","signature_b64":"gvG5Dh6rCdiz+KyFA5fLiIoE7n6RohsoNk2o8vKcqbhkh8ChxN2tTvh0HRIRgO0+kgjKnJcJbpsBlJKpP8jSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af86e51e4400ee1eac42d1c5cac5703005605302a5b7a149212d94b9fb7c6aec","last_reissued_at":"2026-05-18T02:44:32.348483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:32.348483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5087","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aO4kBYmufekQo8BTQOfioZCcvl4QGYokRoyaIbS5gluOR2/jZVyB6szaMQH9vFrn9R3gjkazVn0D2s9qm0wOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:48:20.642233Z"},"content_sha256":"1846e5930bbf4655f4a819a252bef229924914bf25cde6521355ccadcdc1a55f","schema_version":"1.0","event_id":"sha256:1846e5930bbf4655f4a819a252bef229924914bf25cde6521355ccadcdc1a55f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:V6DOKHSEADXB5LCC2HC4VRLQGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric quantum fully homomorphic encryption with perfect security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Min Liang","submitted_at":"2013-04-18T11:23:29Z","abstract_excerpt":"Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$-qubit state that has been encrypted. Comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5087","kind":"arxiv","version":4},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhwqpGpsH4phuRIxCFnwWl0maeHkZo/0tsElA78gl8Ww99BC33OARmAOnbVl4eF7D86tnWxVE/iWmAAwAN9xCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:48:20.642829Z"},"content_sha256":"326efeaa622beb1c3b57d7308e2ced8110e36bd28ced76e668aaf93c61a58f32","schema_version":"1.0","event_id":"sha256:326efeaa622beb1c3b57d7308e2ced8110e36bd28ced76e668aaf93c61a58f32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/bundle.json","state_url":"https://pith.science/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T13:48:20Z","links":{"resolver":"https://pith.science/pith/V6DOKHSEADXB5LCC2HC4VRLQGA","bundle":"https://pith.science/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/bundle.json","state":"https://pith.science/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V6DOKHSEADXB5LCC2HC4VRLQGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:V6DOKHSEADXB5LCC2HC4VRLQGA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"809512b5a093fbe41eb70ce5c55bc8a209585e23b507859cfaeda9fdd436dd69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-18T11:23:29Z","title_canon_sha256":"c29554bfab7a3dadcd0fb24a6a2c9e0c36ca0b8586c582529b26ecab1e7bfb58"},"schema_version":"1.0","source":{"id":"1304.5087","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5087","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5087v4","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5087","created_at":"2026-05-18T02:44:32Z"},{"alias_kind":"pith_short_12","alias_value":"V6DOKHSEADXB","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"V6DOKHSEADXB5LCC","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"V6DOKHSE","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:326efeaa622beb1c3b57d7308e2ced8110e36bd28ced76e668aaf93c61a58f32","target":"graph","created_at":"2026-05-18T02:44:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any $n$-qubit state that has been encrypted. Comp","authors_text":"Min Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-18T11:23:29Z","title":"Symmetric quantum fully homomorphic encryption with perfect security"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5087","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1846e5930bbf4655f4a819a252bef229924914bf25cde6521355ccadcdc1a55f","target":"record","created_at":"2026-05-18T02:44:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"809512b5a093fbe41eb70ce5c55bc8a209585e23b507859cfaeda9fdd436dd69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-04-18T11:23:29Z","title_canon_sha256":"c29554bfab7a3dadcd0fb24a6a2c9e0c36ca0b8586c582529b26ecab1e7bfb58"},"schema_version":"1.0","source":{"id":"1304.5087","kind":"arxiv","version":4}},"canonical_sha256":"af86e51e4400ee1eac42d1c5cac5703005605302a5b7a149212d94b9fb7c6aec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af86e51e4400ee1eac42d1c5cac5703005605302a5b7a149212d94b9fb7c6aec","first_computed_at":"2026-05-18T02:44:32.348483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:32.348483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gvG5Dh6rCdiz+KyFA5fLiIoE7n6RohsoNk2o8vKcqbhkh8ChxN2tTvh0HRIRgO0+kgjKnJcJbpsBlJKpP8jSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:32.349075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5087","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1846e5930bbf4655f4a819a252bef229924914bf25cde6521355ccadcdc1a55f","sha256:326efeaa622beb1c3b57d7308e2ced8110e36bd28ced76e668aaf93c61a58f32"],"state_sha256":"b3788f252050c7ff573915c757816c561c197bd97524d1ce63f3d5d778637355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vWDphS/ZA/v0qZ9RJH+T2ID53QIevDISvqzZiHmSKQkJgkTeAAEzJTGOsrbNkBUqv72jLqCOCfkNTLk3ySm1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:48:20.646965Z","bundle_sha256":"c969783549b66d02ed81ffa341ccaf0eb706c8111a84c29a4e1d88ec162b2809"}}