{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WPE4NNJFCMJ3CDSGK4VJI4FXF7","short_pith_number":"pith:WPE4NNJF","canonical_record":{"source":{"id":"2605.01985","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-03T17:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"3e7ec42b696bddc3f7d2822e30ba1e3ac2b1e1b475e87cf70c6098d4ed6386ba","abstract_canon_sha256":"873d8537a071e3a39aa25e6a21de12e435df16c5473089a880c931d322e1f6d8"},"schema_version":"1.0"},"canonical_sha256":"b3c9c6b5251313b10e46572a9470b72fc2a05c04b840341f07bd3dcb903f7196","source":{"kind":"arxiv","id":"2605.01985","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01985","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01985v2","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01985","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_12","alias_value":"WPE4NNJFCMJ3","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_16","alias_value":"WPE4NNJFCMJ3CDSG","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_8","alias_value":"WPE4NNJF","created_at":"2026-07-13T01:20:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WPE4NNJFCMJ3CDSGK4VJI4FXF7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.01985","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-03T17:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"3e7ec42b696bddc3f7d2822e30ba1e3ac2b1e1b475e87cf70c6098d4ed6386ba","abstract_canon_sha256":"873d8537a071e3a39aa25e6a21de12e435df16c5473089a880c931d322e1f6d8"},"schema_version":"1.0"},"canonical_sha256":"b3c9c6b5251313b10e46572a9470b72fc2a05c04b840341f07bd3dcb903f7196","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-13T01:20:08.599973Z","signature_b64":"cx/ofVbwwht2deUbq9coa41hVlE7aC/MubtJOs58HsrRjAJ4BP4g3kgM58L5wEWtYp5Fw3u/PkaDw6pQ/CSxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c9c6b5251313b10e46572a9470b72fc2a05c04b840341f07bd3dcb903f7196","last_reissued_at":"2026-07-13T01:20:08.598533Z","signature_status":"signed_v1","first_computed_at":"2026-07-13T01:20:08.598533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.01985","source_version":2,"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-07-13T01:20:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vN5rtBDt4a/zEnWUp/0sR6PQSQEoJUi9DY+x4ZztoC2QnZCcJywJ8ViA6evAAZwntgvzR76t8mCCUSzgrhaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:17:23.424384Z"},"content_sha256":"a1997a27e750d36fd4086dbf2b87591af2d688eb85b95d4694325975d8536117","schema_version":"1.0","event_id":"sha256:a1997a27e750d36fd4086dbf2b87591af2d688eb85b95d4694325975d8536117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WPE4NNJFCMJ3CDSGK4VJI4FXF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Plausible Deniability in Fully Homomorphic Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Shahzad Ahmad, Stefan Rass, Zahra Seyedi","submitted_at":"2026-05-03T17:35:46Z","abstract_excerpt":"We introduce \\emph{Plausible Deniability in Fully Homomorphic Computation} (PD-FHC), a framework enabling users to outsource Boolean computations to an untrusted cloud while maintaining both computational privacy against honest-but-curious providers and plausible deniability against coercive adversaries. We define the notion of a \\emph{Deniable Computation Medium} (DCM) and a \\emph{Deniable Computation Scheme} (DCS) as medium-independent abstractions, then instantiate them using RGB images with Fredkin-gate circuits. One real circuit and several decoys share a single fixed Fredkin-gate wiring."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We formalize multi-round coercion games with existence and intent distinguishing advantages, proving computational privacy with advantage Θ(1/(n-1)!) and negligible existence-hiding advantage for the image instantiation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That embedding multiple computation scenarios at secret positions in cover images and having the cloud apply identical pixel-wise operations allows the real computation to remain hidden while still permitting verifiable decoy results under coercion.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PD-FHC embeds one real and multiple decoy Boolean computations in RGB images using Fredkin-gate circuits so the cloud processes them uniformly, allowing the user to reveal only a decoy under coercion while hiding the real result.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"88fd66a2d20189680f38c39835ea763a416b12e46de655d5be65a220e9acfef9"},"source":{"id":"2605.01985","kind":"arxiv","version":2},"verdict":{"id":"6d53c7a1-3250-43f7-be28-2d596c3d3781","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-09T16:59:11.641687Z","strongest_claim":"We formalize multi-round coercion games with existence and intent distinguishing advantages, proving computational privacy with advantage Θ(1/(n-1)!) and negligible existence-hiding advantage for the image instantiation.","one_line_summary":"PD-FHC embeds one real and multiple decoy Boolean computations in RGB images using Fredkin-gate circuits so the cloud processes them uniformly, allowing the user to reveal only a decoy under coercion while hiding the real result.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That embedding multiple computation scenarios at secret positions in cover images and having the cloud apply identical pixel-wise operations allows the real computation to remain hidden while still permitting verifiable decoy results under coercion.","pith_extraction_headline":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.01985/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T16:40:15.127448Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T04:31:22.446159Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:49:22.346959Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"5f5196e4bc5c8f4b9155c7d74fb0959b3cbe7a72e92bf0291cde68d537f8e47e"},"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":"6d53c7a1-3250-43f7-be28-2d596c3d3781"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-13T01:20:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NO90bXeYc+qCHLZ/L65IdDVW0SNCWOAUCkvcCLPNVBMPrwbnrwBvIBAeIVaiqaEvez7Bas91PtrEM0eOEAhKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T08:17:23.425097Z"},"content_sha256":"a2a3ecea4a776452a1fdab320c6e07c9058da9a6c3425eabc1a5a1e3715c02cb","schema_version":"1.0","event_id":"sha256:a2a3ecea4a776452a1fdab320c6e07c9058da9a6c3425eabc1a5a1e3715c02cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/bundle.json","state_url":"https://pith.science/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/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-08-05T08:17:23Z","links":{"resolver":"https://pith.science/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7","bundle":"https://pith.science/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/bundle.json","state":"https://pith.science/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPE4NNJFCMJ3CDSGK4VJI4FXF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WPE4NNJFCMJ3CDSGK4VJI4FXF7","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":"873d8537a071e3a39aa25e6a21de12e435df16c5473089a880c931d322e1f6d8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-03T17:35:46Z","title_canon_sha256":"3e7ec42b696bddc3f7d2822e30ba1e3ac2b1e1b475e87cf70c6098d4ed6386ba"},"schema_version":"1.0","source":{"id":"2605.01985","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.01985","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"arxiv_version","alias_value":"2605.01985v2","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.01985","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_12","alias_value":"WPE4NNJFCMJ3","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_16","alias_value":"WPE4NNJFCMJ3CDSG","created_at":"2026-07-13T01:20:08Z"},{"alias_kind":"pith_short_8","alias_value":"WPE4NNJF","created_at":"2026-07-13T01:20:08Z"}],"graph_snapshots":[{"event_id":"sha256:a2a3ecea4a776452a1fdab320c6e07c9058da9a6c3425eabc1a5a1e3715c02cb","target":"graph","created_at":"2026-07-13T01:20:08Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We formalize multi-round coercion games with existence and intent distinguishing advantages, proving computational privacy with advantage Θ(1/(n-1)!) and negligible existence-hiding advantage for the image instantiation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That embedding multiple computation scenarios at secret positions in cover images and having the cloud apply identical pixel-wise operations allows the real computation to remain hidden while still permitting verifiable decoy results under coercion."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PD-FHC embeds one real and multiple decoy Boolean computations in RGB images using Fredkin-gate circuits so the cloud processes them uniformly, allowing the user to reveal only a decoy under coercion while hiding the real result."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion."}],"snapshot_sha256":"88fd66a2d20189680f38c39835ea763a416b12e46de655d5be65a220e9acfef9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T16:40:15.127448Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T04:31:22.446159Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:49:22.346959Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.01985/integrity.json","findings":[],"snapshot_sha256":"5f5196e4bc5c8f4b9155c7d74fb0959b3cbe7a72e92bf0291cde68d537f8e47e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce \\emph{Plausible Deniability in Fully Homomorphic Computation} (PD-FHC), a framework enabling users to outsource Boolean computations to an untrusted cloud while maintaining both computational privacy against honest-but-curious providers and plausible deniability against coercive adversaries. We define the notion of a \\emph{Deniable Computation Medium} (DCM) and a \\emph{Deniable Computation Scheme} (DCS) as medium-independent abstractions, then instantiate them using RGB images with Fredkin-gate circuits. One real circuit and several decoys share a single fixed Fredkin-gate wiring.","authors_text":"Shahzad Ahmad, Stefan Rass, Zahra Seyedi","cross_cats":[],"headline":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-03T17:35:46Z","title":"Plausible Deniability in Fully Homomorphic Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.01985","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-09T16:59:11.641687Z","id":"6d53c7a1-3250-43f7-be28-2d596c3d3781","model_set":{"reader":"grok-4.3"},"one_line_summary":"PD-FHC embeds one real and multiple decoy Boolean computations in RGB images using Fredkin-gate circuits so the cloud processes them uniformly, allowing the user to reveal only a decoy under coercion while hiding the real result.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Embedding multiple computation scenarios in images lets users outsource tasks to the cloud while revealing only a verifiable decoy under coercion.","strongest_claim":"We formalize multi-round coercion games with existence and intent distinguishing advantages, proving computational privacy with advantage Θ(1/(n-1)!) and negligible existence-hiding advantage for the image instantiation.","weakest_assumption":"That embedding multiple computation scenarios at secret positions in cover images and having the cloud apply identical pixel-wise operations allows the real computation to remain hidden while still permitting verifiable decoy results under coercion."}},"verdict_id":"6d53c7a1-3250-43f7-be28-2d596c3d3781"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a1997a27e750d36fd4086dbf2b87591af2d688eb85b95d4694325975d8536117","target":"record","created_at":"2026-07-13T01:20:08Z","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":"873d8537a071e3a39aa25e6a21de12e435df16c5473089a880c931d322e1f6d8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-03T17:35:46Z","title_canon_sha256":"3e7ec42b696bddc3f7d2822e30ba1e3ac2b1e1b475e87cf70c6098d4ed6386ba"},"schema_version":"1.0","source":{"id":"2605.01985","kind":"arxiv","version":2}},"canonical_sha256":"b3c9c6b5251313b10e46572a9470b72fc2a05c04b840341f07bd3dcb903f7196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3c9c6b5251313b10e46572a9470b72fc2a05c04b840341f07bd3dcb903f7196","first_computed_at":"2026-07-13T01:20:08.598533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-13T01:20:08.598533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cx/ofVbwwht2deUbq9coa41hVlE7aC/MubtJOs58HsrRjAJ4BP4g3kgM58L5wEWtYp5Fw3u/PkaDw6pQ/CSxCA==","signature_status":"signed_v1","signed_at":"2026-07-13T01:20:08.599973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.01985","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1997a27e750d36fd4086dbf2b87591af2d688eb85b95d4694325975d8536117","sha256:a2a3ecea4a776452a1fdab320c6e07c9058da9a6c3425eabc1a5a1e3715c02cb"],"state_sha256":"4293bd32ead80e585c85a75693c59821e6cfe0fd377e785f0cf76b6d40baa0f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soCCiFRyhQ8buBxa+8RlMYyRXEnddC9QVHX+IsklrQyVrWhkfCkAsyvSMXMV89qSj19+QK6Ws6H4x7IPVNmNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T08:17:23.428788Z","bundle_sha256":"dbfd9486747328b72bbec66b8ebfabb947054c7a56989b4b7e82b32888a382f7"}}