{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:75BKUP7NFADXK62DYYV4UOIVOH","short_pith_number":"pith:75BKUP7N","schema_version":"1.0","canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","source":{"kind":"arxiv","id":"1905.10921","version":1},"attestation_state":"computed","paper":{"title":"On the Commitment Capacity of Unfair Noisy Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Claude Cr\\'epeau, Rafael Dowsley","submitted_at":"2019-05-27T01:26:23Z","abstract_excerpt":"Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg\\r{a}rd et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious"},"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":"1905.10921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-27T01:26:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"08776927daef94ca41f0b9f1e273acc040e536ef620bd339da5afcfd9dc010bf","abstract_canon_sha256":"1bc4dcf528da2438c9077e180daac2ae43a6d840b044d8d2826733a3ac4b3383"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:03.398219Z","signature_b64":"dQg6xZcj6V431xpmXhKoqzbnnWCJwLPVXLy7QUgyP5JT3IS8wpCsv3JK8V+qM2mYMMgVPo9pg54WYoF5PTxXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff42aa3fed2807757b43c62bca391571e7857443562e8db8c1f1e6c1428c9788","last_reissued_at":"2026-05-17T23:45:03.397670Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:03.397670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Commitment Capacity of Unfair Noisy Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Anderson C. A. Nascimento, Claude Cr\\'epeau, Rafael Dowsley","submitted_at":"2019-05-27T01:26:23Z","abstract_excerpt":"Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be consider in the scenario where a cheating party has some degree of control over the channel characteristics. Damg\\r{a}rd et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10921","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":"1905.10921","created_at":"2026-05-17T23:45:03.397744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10921v1","created_at":"2026-05-17T23:45:03.397744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10921","created_at":"2026-05-17T23:45:03.397744+00:00"},{"alias_kind":"pith_short_12","alias_value":"75BKUP7NFADX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"75BKUP7NFADXK62D","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"75BKUP7N","created_at":"2026-05-18T12:33:12.712433+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/75BKUP7NFADXK62DYYV4UOIVOH","json":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH.json","graph_json":"https://pith.science/api/pith-number/75BKUP7NFADXK62DYYV4UOIVOH/graph.json","events_json":"https://pith.science/api/pith-number/75BKUP7NFADXK62DYYV4UOIVOH/events.json","paper":"https://pith.science/paper/75BKUP7N"},"agent_actions":{"view_html":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH","download_json":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH.json","view_paper":"https://pith.science/paper/75BKUP7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10921&json=true","fetch_graph":"https://pith.science/api/pith-number/75BKUP7NFADXK62DYYV4UOIVOH/graph.json","fetch_events":"https://pith.science/api/pith-number/75BKUP7NFADXK62DYYV4UOIVOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/action/storage_attestation","attest_author":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/action/author_attestation","sign_citation":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/action/citation_signature","submit_replication":"https://pith.science/pith/75BKUP7NFADXK62DYYV4UOIVOH/action/replication_record"}},"created_at":"2026-05-17T23:45:03.397744+00:00","updated_at":"2026-05-17T23:45:03.397744+00:00"}