Pith Number

pith:UNFNDGF6

pith:2026:UNFNDGF624ABZSOJOLHTNPHHP2

not attested not anchored not stored refs pending

A Framework of Secure Source Coding using Mutual Information Security Criterion: Universal Coding, Strong Converse Theorem

Bagus Santoso, Yasutada Oohama

Necessary and sufficient condition for secure source coding is independent of error and leakage bounds

arxiv:2605.04720 v2 · 2026-05-06 · cs.IT · math.IT

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{UNFNDGF624ABZSOJOLHTNPHHP2}

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

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

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

Cited by

1 paper in Pith

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

Receipt and verification

First computed	2026-05-22T01:04:04.360690Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

a34ad198bed7001cc9c972cf36bce77eb65c7554b522735485b9b8b6cef51861

Aliases

arxiv: 2605.04720 · arxiv_version: 2605.04720v2 · doi: 10.48550/arxiv.2605.04720 · pith_short_12: UNFNDGF624AB · pith_short_16: UNFNDGF624ABZSOJ · pith_short_8: UNFNDGF6

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/UNFNDGF624ABZSOJOLHTNPHHP2 \
  | 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: a34ad198bed7001cc9c972cf36bce77eb65c7554b522735485b9b8b6cef51861

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "e6515177685d3f1a598899bafb0da63e6d8c1a8ab290a353b6f5a455d22faf22",
    "cross_cats_sorted": [
      "math.IT"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IT",
    "submitted_at": "2026-05-06T10:10:33Z",
    "title_canon_sha256": "e45e8d81c8aa55028ba8cd49ab6176b88c70455e2235f393e87f96b7af966bd5"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.04720",
    "kind": "arxiv",
    "version": 2
  }
}