{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YWVJHB6BY26XNMCQH6N6PW7LR5","short_pith_number":"pith:YWVJHB6B","schema_version":"1.0","canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","source":{"kind":"arxiv","id":"1409.1657","version":1},"attestation_state":"computed","paper":{"title":"On the Optimality of Keyless Authentication in a Noisy Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shaoquan Jiang","submitted_at":"2014-09-05T03:34:31Z","abstract_excerpt":"We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\\log^*|{\\cal S}|-\\log^*n+4.$ In addition, we show that the round complexity of any secure "},"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":false},"canonical_record":{"source":{"id":"1409.1657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-05T03:34:31Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"e7bdbbde568074d7ed729239fb746e765c80c8fb7a631825c8eb17c026ceacf0","abstract_canon_sha256":"9f47b7603ae89347a50ce0e2460788980754725fd3db075c90aaef0f8c2b36e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.594446Z","signature_b64":"E0q5TGt9vofiphdESLLhvbD7LcSxgCzQchlsSU9wLhiAYzXpI/q8F2l+F9sQu4vlwe8Ch1AFSQJnOXWoN1jxDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5aa9387c1c6bd76b0503f9be7dbeb8f75e796d65ea2ddbdcba08a4690dec27b","last_reissued_at":"2026-05-18T02:43:25.593897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.593897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Optimality of Keyless Authentication in a Noisy Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Shaoquan Jiang","submitted_at":"2014-09-05T03:34:31Z","abstract_excerpt":"We further study the keyless authentication problem in a noisy model in our previous work, where no secret setup is available for sender Alice and receiver Bob while there is DMC $W_1$ from Alice to Bob and a two-way noiseless but insecure channel between them. We propose a construction such that the message length over DMC $W_1$ does not depend on the size of the source space. If the source space is ${\\cal S}$ and the number of channel $W_1$ uses is $n$, then our protocol only has a round complexity of $\\log^*|{\\cal S}|-\\log^*n+4.$ In addition, we show that the round complexity of any secure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1657","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"1409.1657","created_at":"2026-05-18T02:43:25.593991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1657v1","created_at":"2026-05-18T02:43:25.593991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1657","created_at":"2026-05-18T02:43:25.593991+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWVJHB6BY26X","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWVJHB6BY26XNMCQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWVJHB6B","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5","json":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5.json","graph_json":"https://pith.science/api/pith-number/YWVJHB6BY26XNMCQH6N6PW7LR5/graph.json","events_json":"https://pith.science/api/pith-number/YWVJHB6BY26XNMCQH6N6PW7LR5/events.json","paper":"https://pith.science/paper/YWVJHB6B"},"agent_actions":{"view_html":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5","download_json":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5.json","view_paper":"https://pith.science/paper/YWVJHB6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1657&json=true","fetch_graph":"https://pith.science/api/pith-number/YWVJHB6BY26XNMCQH6N6PW7LR5/graph.json","fetch_events":"https://pith.science/api/pith-number/YWVJHB6BY26XNMCQH6N6PW7LR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/action/storage_attestation","attest_author":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/action/author_attestation","sign_citation":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/action/citation_signature","submit_replication":"https://pith.science/pith/YWVJHB6BY26XNMCQH6N6PW7LR5/action/replication_record"}},"created_at":"2026-05-18T02:43:25.593991+00:00","updated_at":"2026-05-18T02:43:25.593991+00:00"}