{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP","short_pith_number":"pith:ACHOR3A3","schema_version":"1.0","canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","source":{"kind":"arxiv","id":"2605.06802","version":3},"attestation_state":"computed","paper":{"title":"A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bagus Santoso, Yasutada Oohama","submitted_at":"2026-05-07T18:05:21Z","abstract_excerpt":"In this paper we consider the variable-length lossless source coding for discrete memoryless sources. We proposes a new encryption framework for securely transmitting codewords over a noiseless channel. 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. We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant $\\delta\\in ("},"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":true},"canonical_record":{"source":{"id":"2605.06802","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-07T18:05:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1","abstract_canon_sha256":"ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:10.220736Z","signature_b64":"zGA4G3MuWtfXiBzUS5SqCZRmiwCnAEu6Wjbzqf2W/1AB5zHvN6MCWJZ3XyWg9L02YLOr4o68zc0zPzFozTTkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59","last_reissued_at":"2026-05-26T02:05:10.219766Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:10.219766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bagus Santoso, Yasutada Oohama","submitted_at":"2026-05-07T18:05:21Z","abstract_excerpt":"In this paper we consider the variable-length lossless source coding for discrete memoryless sources. We proposes a new encryption framework for securely transmitting codewords over a noiseless channel. 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. We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant $\\delta\\in ("},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding 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 source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"41446edf09b0745b21ffe9d0e7f5fe6dc09f787da910d4c05c1cc4c7a9903a31"},"source":{"id":"2605.06802","kind":"arxiv","version":3},"verdict":{"id":"d67afa60-6e7a-4383-83a6-f78fa9347e24","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T06:47:35.229611Z","strongest_claim":"We establish the necessary and sufficient condition for secure communication under the condition that the information leakage is upper bounded by a constant δ∈(0,∞), thereby providing a complete solution to the problem. We also show that the obtained necessary and sufficient condition does not depend on the constant δ∈(0,∞), demonstrating that we have the strong converse coding 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":"The paper gives necessary and sufficient conditions for secure variable-length source encryption under mutual information leakage bounded by any δ>0, proves these conditions are independent of δ (strong converse), and shows existence of universal encryption schemes for any source and key statistics.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The source is discrete memoryless and the transmission channel is noiseless; the framework inherits the Shannon cipher system model in which sender and receiver share a secret key whose distribution is independent of the source.","pith_extraction_headline":"Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.06802/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T12:02:03.821213Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T07:36:02.444091Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:18.883056Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T12:23:06.797498Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"49af7b665b54b73dcb88cc1df5c32903c7d3d4cbf443503f482dbfdb5c6e932e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"5512da4b0e1b57cb46baf3886030b1c0b721da7cd1d162f2df00cdf4aa1ba15c"},"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.06802","created_at":"2026-05-26T02:05:10.219894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.06802v3","created_at":"2026-05-26T02:05:10.219894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06802","created_at":"2026-05-26T02:05:10.219894+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACHOR3A3UW7F","created_at":"2026-05-26T02:05:10.219894+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACHOR3A3UW7FA4LR","created_at":"2026-05-26T02:05:10.219894+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACHOR3A3","created_at":"2026-05-26T02:05:10.219894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"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":1,"is_internal_anchor":true},{"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":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":1,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP","json":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP.json","graph_json":"https://pith.science/api/pith-number/ACHOR3A3UW7FA4LRPNJ5QYS7DP/graph.json","events_json":"https://pith.science/api/pith-number/ACHOR3A3UW7FA4LRPNJ5QYS7DP/events.json","paper":"https://pith.science/paper/ACHOR3A3"},"agent_actions":{"view_html":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP","download_json":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP.json","view_paper":"https://pith.science/paper/ACHOR3A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.06802&json=true","fetch_graph":"https://pith.science/api/pith-number/ACHOR3A3UW7FA4LRPNJ5QYS7DP/graph.json","fetch_events":"https://pith.science/api/pith-number/ACHOR3A3UW7FA4LRPNJ5QYS7DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/action/storage_attestation","attest_author":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/action/author_attestation","sign_citation":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/action/citation_signature","submit_replication":"https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP/action/replication_record"}},"created_at":"2026-05-26T02:05:10.219894+00:00","updated_at":"2026-05-26T02:05:10.219894+00:00"}