{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UNFNDGF624ABZSOJOLHTNPHHP2","short_pith_number":"pith:UNFNDGF6","schema_version":"1.0","canonical_sha256":"a34ad198bed7001cc9c972cf36bce77eb65c7554b522735485b9b8b6cef51861","source":{"kind":"arxiv","id":"2605.04720","version":2},"attestation_state":"computed","paper":{"title":"A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Necessary and sufficient condition for secure source coding is independent of error and leakage bounds","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bagus Santoso, Yasutada Oohama","submitted_at":"2026-05-06T10:10:33Z","abstract_excerpt":"In this paper, we propose a framework of source encryption, where cryptographic processing is applied to a prescribed fixed length source code. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. For the proposed framework, we explicitly establish the necessary and sufficient condition for reliable and secure communication under the condition that error probability and information leakage, respectively, are upper bounded"},"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":"2605.04720","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-06T10:10:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e45e8d81c8aa55028ba8cd49ab6176b88c70455e2235f393e87f96b7af966bd5","abstract_canon_sha256":"e6515177685d3f1a598899bafb0da63e6d8c1a8ab290a353b6f5a455d22faf22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:04.361277Z","signature_b64":"YaBd+DY5HqLL3YncSXL3ybpHgqQzRH0/3xEEi6lNBFiuzk4UQYmkgvTE2OpBM5hSY+uN61cH++ob+Ua6SXxiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a34ad198bed7001cc9c972cf36bce77eb65c7554b522735485b9b8b6cef51861","last_reissued_at":"2026-05-22T01:04:04.360690Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:04.360690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Necessary and sufficient condition for secure source coding is independent of error and leakage bounds","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bagus Santoso, Yasutada Oohama","submitted_at":"2026-05-06T10:10:33Z","abstract_excerpt":"In this paper, we propose a framework of source encryption, where cryptographic processing is applied to a prescribed fixed length source code. The proposed source encryption framework is based on the secure communication framework of the Shannon cipher system. In the proposed framework, we use the mutual information as a measure of information leakage to an adversary. For the proposed framework, we explicitly establish the necessary and sufficient condition for reliable and secure communication under the condition that error probability and information leakage, respectively, are upper bounded"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We explicitly establish the necessary and sufficient condition for reliable and secure communication under the condition that error probability and information leakage, respectively, are upper bounded by prescribed constants ε∈(0,1) and δ∈(0,∞). We also show that the obtained necessary and sufficient condition does not depend on the constants ε∈(0,1) and δ∈(0,∞), demonstrating that we have the strong converse theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The framework assumes that cryptographic processing is applied to a prescribed fixed length source code, that mutual information is a suitable measure of information leakage, and that the source and key follow arbitrary but fixed distributions for which the universal schemes must hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A secure source coding framework is developed with a strong converse theorem under mutual information leakage bounds, showing conditions independent of error and leakage tolerances, and proving universal schemes exist for arbitrary distributions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Necessary and sufficient condition for secure source coding is independent of error and leakage bounds","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a7615906d2e98e00fb66813530108ff9fa5a6e12c9cd691cc167e86df3316f87"},"source":{"id":"2605.04720","kind":"arxiv","version":2},"verdict":{"id":"07f92a95-a463-49f7-a77f-5573697356f0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T16:33:43.384347Z","strongest_claim":"We explicitly establish the necessary and sufficient condition for reliable and secure communication under the condition that error probability and information leakage, respectively, are upper bounded by prescribed constants ε∈(0,1) and δ∈(0,∞). We also show that the obtained necessary and sufficient condition does not depend on the constants ε∈(0,1) and δ∈(0,∞), demonstrating that we have the strong converse theorem for the proposed framework of source encryption. We further prove the existence of encryption/decryption schemes, which are universal in the sense that they work effectively for any distributions of the plain text and those of the key used for the encryption.","one_line_summary":"A secure source coding framework is developed with a strong converse theorem under mutual information leakage bounds, showing conditions independent of error and leakage tolerances, and proving universal schemes exist for arbitrary distributions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The framework assumes that cryptographic processing is applied to a prescribed fixed length source code, that mutual information is a suitable measure of information leakage, and that the source and key follow arbitrary but fixed distributions for which the universal schemes must hold.","pith_extraction_headline":"Necessary and sufficient condition for secure source coding is independent of error and leakage bounds"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04720/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T11:35:15.947558Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.709501Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:12:53.861969Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"445781a3c0a1b113438ee993ad4748adcad92d8dde5d1d135012f0479aeb332c"},"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":"2605.04720","created_at":"2026-05-22T01:04:04.360796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.04720v2","created_at":"2026-05-22T01:04:04.360796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04720","created_at":"2026-05-22T01:04:04.360796+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNFNDGF624AB","created_at":"2026-05-22T01:04:04.360796+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNFNDGF624ABZSOJ","created_at":"2026-05-22T01:04:04.360796+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNFNDGF6","created_at":"2026-05-22T01:04:04.360796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.06802","citing_title":"A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2","json":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2.json","graph_json":"https://pith.science/api/pith-number/UNFNDGF624ABZSOJOLHTNPHHP2/graph.json","events_json":"https://pith.science/api/pith-number/UNFNDGF624ABZSOJOLHTNPHHP2/events.json","paper":"https://pith.science/paper/UNFNDGF6"},"agent_actions":{"view_html":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2","download_json":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2.json","view_paper":"https://pith.science/paper/UNFNDGF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.04720&json=true","fetch_graph":"https://pith.science/api/pith-number/UNFNDGF624ABZSOJOLHTNPHHP2/graph.json","fetch_events":"https://pith.science/api/pith-number/UNFNDGF624ABZSOJOLHTNPHHP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2/action/storage_attestation","attest_author":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2/action/author_attestation","sign_citation":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2/action/citation_signature","submit_replication":"https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2/action/replication_record"}},"created_at":"2026-05-22T01:04:04.360796+00:00","updated_at":"2026-05-22T01:04:04.360796+00:00"}