{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SXVCS5IWS7PYMSNEQ3DDULCJGS","short_pith_number":"pith:SXVCS5IW","schema_version":"1.0","canonical_sha256":"95ea29751697df8649a486c63a2c4934bd86d3382d7f5c64b49bc3cf3848cd95","source":{"kind":"arxiv","id":"1105.1601","version":2},"attestation_state":"computed","paper":{"title":"Code Reverse Engineering problem for Identification Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Herv\\'e Chabanne, Julien Bringer","submitted_at":"2011-05-09T08:47:11Z","abstract_excerpt":"At ITW'10, Bringer et al. suggest to strengthen their previous identification protocol by extending the Code Reverse Engineering (CRE) problem to identification codes. We first extend security results by Tillich et al. on this very problem. We then prove the security of this protocol using information theoretical arguments."},"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":"1105.1601","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-05-09T08:47:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fb4baa763b16fb4d7c1a8edc8dc8765f3a825865509da8fb292acb7476e07718","abstract_canon_sha256":"fb5ca2d892f31bb7e53b6d165cff72d94c48c1a7def19bc235ebb39dc937fd59"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.533225Z","signature_b64":"0G87e9wtKlYpUaSqsFw3K2wwBSTEkxRlEwYoNh2Aw+RgNc74f6uEpb228ecGrewWIozt0ssAcj8bp7qAzoJ2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95ea29751697df8649a486c63a2c4934bd86d3382d7f5c64b49bc3cf3848cd95","last_reissued_at":"2026-05-18T02:22:00.532703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.532703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code Reverse Engineering problem for Identification Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Herv\\'e Chabanne, Julien Bringer","submitted_at":"2011-05-09T08:47:11Z","abstract_excerpt":"At ITW'10, Bringer et al. suggest to strengthen their previous identification protocol by extending the Code Reverse Engineering (CRE) problem to identification codes. We first extend security results by Tillich et al. on this very problem. We then prove the security of this protocol using information theoretical arguments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1601","kind":"arxiv","version":2},"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":"1105.1601","created_at":"2026-05-18T02:22:00.532780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1601v2","created_at":"2026-05-18T02:22:00.532780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1601","created_at":"2026-05-18T02:22:00.532780+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXVCS5IWS7PY","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXVCS5IWS7PYMSNE","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXVCS5IW","created_at":"2026-05-18T12:26:41.206345+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/SXVCS5IWS7PYMSNEQ3DDULCJGS","json":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS.json","graph_json":"https://pith.science/api/pith-number/SXVCS5IWS7PYMSNEQ3DDULCJGS/graph.json","events_json":"https://pith.science/api/pith-number/SXVCS5IWS7PYMSNEQ3DDULCJGS/events.json","paper":"https://pith.science/paper/SXVCS5IW"},"agent_actions":{"view_html":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS","download_json":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS.json","view_paper":"https://pith.science/paper/SXVCS5IW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1601&json=true","fetch_graph":"https://pith.science/api/pith-number/SXVCS5IWS7PYMSNEQ3DDULCJGS/graph.json","fetch_events":"https://pith.science/api/pith-number/SXVCS5IWS7PYMSNEQ3DDULCJGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS/action/storage_attestation","attest_author":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS/action/author_attestation","sign_citation":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS/action/citation_signature","submit_replication":"https://pith.science/pith/SXVCS5IWS7PYMSNEQ3DDULCJGS/action/replication_record"}},"created_at":"2026-05-18T02:22:00.532780+00:00","updated_at":"2026-05-18T02:22:00.532780+00:00"}