{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NX4SR2DMJXJFCOO5LDSWQLWM6G","short_pith_number":"pith:NX4SR2DM","schema_version":"1.0","canonical_sha256":"6df928e86c4dd25139dd58e5682eccf1a0e567cf2463c5c3e760f01500b083b6","source":{"kind":"arxiv","id":"2605.23316","version":1},"attestation_state":"computed","paper":{"title":"Formal Verification of Probing Security via Conditional Independence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Katsuyuki Takashima, Satoshi Kura","submitted_at":"2026-05-22T07:34:38Z","abstract_excerpt":"Side-channel attacks are a major threat to the security of cryptosystems. Masking is a widely used countermeasure against such attacks, but proving the security of masked algorithms is error-prone without formal verification. In this work, we propose a novel approach to formal verification of noninterference properties of masked algorithms based on probabilistic separation logic. By establishing a connection between noninterference and conditional independence, we show how noninterference can be verified using Lilac, a separation logic for conditional independence. We also provide several proo"},"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":"2605.23316","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-22T07:34:38Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"c544a9bdedd0aa05b8f505c24306e0ec3df078a4136752a4a2efb26f36fc4c63","abstract_canon_sha256":"8d5df836d5fea0279b2413c588f1f6be7202381759e77574a62a633c2814a9d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:48.628624Z","signature_b64":"yu0oz5JgczPY+JKFj35W061AU4ZpRhthBFQcJ9LFqt3TnFUKFAVV0ZBeKsq1L0wCXcA/PTX0WgzL+MqDOdNPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6df928e86c4dd25139dd58e5682eccf1a0e567cf2463c5c3e760f01500b083b6","last_reissued_at":"2026-05-25T02:01:48.627785Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:48.627785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formal Verification of Probing Security via Conditional Independence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Katsuyuki Takashima, Satoshi Kura","submitted_at":"2026-05-22T07:34:38Z","abstract_excerpt":"Side-channel attacks are a major threat to the security of cryptosystems. Masking is a widely used countermeasure against such attacks, but proving the security of masked algorithms is error-prone without formal verification. In this work, we propose a novel approach to formal verification of noninterference properties of masked algorithms based on probabilistic separation logic. By establishing a connection between noninterference and conditional independence, we show how noninterference can be verified using Lilac, a separation logic for conditional independence. We also provide several proo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23316","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.23316/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.23316","created_at":"2026-05-25T02:01:48.627958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23316v1","created_at":"2026-05-25T02:01:48.627958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23316","created_at":"2026-05-25T02:01:48.627958+00:00"},{"alias_kind":"pith_short_12","alias_value":"NX4SR2DMJXJF","created_at":"2026-05-25T02:01:48.627958+00:00"},{"alias_kind":"pith_short_16","alias_value":"NX4SR2DMJXJFCOO5","created_at":"2026-05-25T02:01:48.627958+00:00"},{"alias_kind":"pith_short_8","alias_value":"NX4SR2DM","created_at":"2026-05-25T02:01:48.627958+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/NX4SR2DMJXJFCOO5LDSWQLWM6G","json":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G.json","graph_json":"https://pith.science/api/pith-number/NX4SR2DMJXJFCOO5LDSWQLWM6G/graph.json","events_json":"https://pith.science/api/pith-number/NX4SR2DMJXJFCOO5LDSWQLWM6G/events.json","paper":"https://pith.science/paper/NX4SR2DM"},"agent_actions":{"view_html":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G","download_json":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G.json","view_paper":"https://pith.science/paper/NX4SR2DM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23316&json=true","fetch_graph":"https://pith.science/api/pith-number/NX4SR2DMJXJFCOO5LDSWQLWM6G/graph.json","fetch_events":"https://pith.science/api/pith-number/NX4SR2DMJXJFCOO5LDSWQLWM6G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G/action/storage_attestation","attest_author":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G/action/author_attestation","sign_citation":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G/action/citation_signature","submit_replication":"https://pith.science/pith/NX4SR2DMJXJFCOO5LDSWQLWM6G/action/replication_record"}},"created_at":"2026-05-25T02:01:48.627958+00:00","updated_at":"2026-05-25T02:01:48.627958+00:00"}