pith. sign in
Pith Number

pith:ACHOR3A3

pith:2026:ACHOR3A3UW7FA4LRPNJ5QYS7DP
not attested not anchored not stored refs pending

A Framework of Variable-Length Source Encryption using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem

Bagus Santoso, Yasutada Oohama

Secure variable-length source encryption is possible exactly when the key rate is at least the source entropy rate, independent of the leakage bound

arxiv:2605.06802 v3 · 2026-05-07 · cs.IT · math.IT

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{ACHOR3A3UW7FA4LRPNJ5QYS7DP}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

Formal links

1 machine-checked theorem link

Cited by

2 papers in Pith

Receipt and verification
First computed 2026-05-26T02:05:10.219766Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59

Aliases

arxiv: 2605.06802 · arxiv_version: 2605.06802v3 · doi: 10.48550/arxiv.2605.06802 · pith_short_12: ACHOR3A3UW7F · pith_short_16: ACHOR3A3UW7FA4LR · pith_short_8: ACHOR3A3
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/ACHOR3A3UW7FA4LRPNJ5QYS7DP \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 008ee8ec1ba5be5071717b53d8625f1bec4b86ec7c0dc6e663c714f45162bb59
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "ab4179c384efe686121e23a8e008912852ccd08c14925003ade8f7308b2d2a1d",
    "cross_cats_sorted": [
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2026-05-07T18:05:21Z",
    "title_canon_sha256": "656904849527841ff9be0db22ea14368340055aefc5518c4ee855f822cccf2b1"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.06802",
    "kind": "arxiv",
    "version": 3
  }
}