Metraipolis › archive › dc_6cbd60a2a2e2

Defining Purpose-Limited Secrets — arXiv:2610.10010

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.10010
License (as archived)
CC0-1.0
Archived
2026-10-08T11:44:32.382Z
SHA-256 of the archived text
28d9f2accb03e80ed438b1f6571d4e97a0b499b63408092a4ec8e89510212231
Stable URL of this page
https://metraipolis.com/documento/dc_6cbd60a2a2e2

How to cite

Defining Purpose-Limited Secrets — arXiv:2610.10010 — arXiv (en), https://arxiv.org/abs/2610.10010 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6cbd60a2a2e2 (Metraipolis archive dc_6cbd60a2a2e2, sha256 28d9f2accb03e80ed438b1f6571d4e97a0b499b63408092a4ec8e89510212231)
BibTeX
@misc{dc6cbd60a2a2e2,
  title = {Defining Purpose-Limited Secrets — arXiv:2610.10010},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.10010},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6cbd60a2a2e2; sha256 28d9f2accb03e80ed438b1f6571d4e97a0b499b63408092a4ec8e89510212231},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10010. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A cryptographic secret is issued for a purpose but grants a capability, and the capability is usually larger: a decryption key meant for computing aggregates can read every record, and a token meant to pay one invoice can drain the account. Deployed systems state the purpose in policy and enforce only the capability. We make the purpose a property of the secret. A mechanism sees operations, not reasons, so a scheme enforces an admissible set $A(P)$ of operations that stands in for a declared intended use $I$; whether $I$ captures the human purpose is a modeling obligation that marks where policy takes over. Against the same $I$ we define three regimes: under confinement an operation outside the intended use is infeasible, under mediation a trusted component refuses it, and under accountability use beyond a stated bound is possible but attributed to the holder. The confinement games, for unpredictability and indistinguishability, coincide with the key-query forms of functional-signature unforgeability and constrained-PRF pseudorandomness and correspond to simulation-secure functional encryption within its feasibility boundary; stated against $I$, they also register a predicate that permits too much. A payment token uses all three regimes on one secret: it pays one capped charge at one merchant, can be narrowed but not widened, is checked by the merchant, and identifies the withdrawing account if spent twice. Attenuation unforgeability reduces to unforgeable signatures and a collision-resistant hash without random oracles; traceability and non-frameability hold under discrete log and unforgeable signatures in the random-oracle model. We claim no new primitive, hardness assumption, or general composition theorem; the framework is a common specification against which such primitives are stated and compared.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.10010 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:45:22.460Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).