{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIKGI56NVSMFKBXU5QJR3DOROG","short_pith_number":"pith:CIKGI56N","schema_version":"1.0","canonical_sha256":"12146477cdac985506f4ec131d8dd1718f2374c040256246f1df69631064171f","source":{"kind":"arxiv","id":"1801.08154","version":1},"attestation_state":"computed","paper":{"title":"On the Gold Standard for Security of Universal Steganography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Maciej Li\\'skiewicz, Sebastian Berndt","submitted_at":"2018-01-24T19:04:38Z","abstract_excerpt":"While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key counterpart resist persistent attempts to solve them. The computational model for public-key steganography was proposed by von Ahn and Hopper in EUROCRYPT 2004. At TCC 2005, Backes and Cachin gave the first universal public-key stegosystem - i.e. one that works on all channels - achieving security against replayable chosen-covertext attacks (SS-RCCA) and asked whether security against non-replayable chosen-covertext attac"},"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":"1801.08154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-24T19:04:38Z","cross_cats_sorted":[],"title_canon_sha256":"fd3c4e517e5b4bec21bb91db84ea08d71162444d8a88d72f43f6540885b778a8","abstract_canon_sha256":"a082a714c21c935e75f2f74621b91a8e723527b0bc7256302925ec611a9271a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:06.970229Z","signature_b64":"Tgv8cDrZf5UvQsHFyT6YEW539K4tU3sWl0QwQLKjRfeyRyP6yhA81ChTYRdhEn/oallyyIDzq1IDJ4GpyQuHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12146477cdac985506f4ec131d8dd1718f2374c040256246f1df69631064171f","last_reissued_at":"2026-05-18T00:25:06.969641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:06.969641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Gold Standard for Security of Universal Steganography","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Maciej Li\\'skiewicz, Sebastian Berndt","submitted_at":"2018-01-24T19:04:38Z","abstract_excerpt":"While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key counterpart resist persistent attempts to solve them. The computational model for public-key steganography was proposed by von Ahn and Hopper in EUROCRYPT 2004. At TCC 2005, Backes and Cachin gave the first universal public-key stegosystem - i.e. one that works on all channels - achieving security against replayable chosen-covertext attacks (SS-RCCA) and asked whether security against non-replayable chosen-covertext attac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08154","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":"1801.08154","created_at":"2026-05-18T00:25:06.969717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08154v1","created_at":"2026-05-18T00:25:06.969717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08154","created_at":"2026-05-18T00:25:06.969717+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIKGI56NVSMF","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIKGI56NVSMFKBXU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIKGI56N","created_at":"2026-05-18T12:32:16.446611+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/CIKGI56NVSMFKBXU5QJR3DOROG","json":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG.json","graph_json":"https://pith.science/api/pith-number/CIKGI56NVSMFKBXU5QJR3DOROG/graph.json","events_json":"https://pith.science/api/pith-number/CIKGI56NVSMFKBXU5QJR3DOROG/events.json","paper":"https://pith.science/paper/CIKGI56N"},"agent_actions":{"view_html":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG","download_json":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG.json","view_paper":"https://pith.science/paper/CIKGI56N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08154&json=true","fetch_graph":"https://pith.science/api/pith-number/CIKGI56NVSMFKBXU5QJR3DOROG/graph.json","fetch_events":"https://pith.science/api/pith-number/CIKGI56NVSMFKBXU5QJR3DOROG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG/action/storage_attestation","attest_author":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG/action/author_attestation","sign_citation":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG/action/citation_signature","submit_replication":"https://pith.science/pith/CIKGI56NVSMFKBXU5QJR3DOROG/action/replication_record"}},"created_at":"2026-05-18T00:25:06.969717+00:00","updated_at":"2026-05-18T00:25:06.969717+00:00"}