arXiv (All)
open access
Keyless secrecy against bounded adversaries
We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the adversary learns nothing about the message unless the receiver aborts. Neither the sender nor the receiver holds a secret
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Information Theory: Coding Theorems for Discrete Memoryless Systems#6618
- Authentication over Arbitrarily Varying Channels with Causal Adversaries#793169
- Authentication over Arbitrarily Varying Channels with Causal Adversaries#789165
- Time-space lower bounds for breaking quantum cryptography#1160915
- Time-space lower bounds for breaking quantum cryptography#1157449
Record · ID 1000211
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive