{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QHGXSQ7IGBFC4VIONX6NALLAZI","short_pith_number":"pith:QHGXSQ7I","schema_version":"1.0","canonical_sha256":"81cd7943e8304a2e550e6dfcd02d60ca3d5200fa7581b4fe8ba0d1c6ec74d81d","source":{"kind":"arxiv","id":"1805.08532","version":1},"attestation_state":"computed","paper":{"title":"New Instantiations of the CRYPTO 2017 Masking Schemes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Daniel S. Roche, Pierre Karpman","submitted_at":"2018-05-22T12:03:51Z","abstract_excerpt":"At CRYPTO 2017, Bela\\\"id et al presented two new private multiplication algorithms over finite fields, to be used in secure masking schemes. To date, these algorithms have the lowest known complexity in terms of bilinear multiplication and random masks respectively, both being linear in the number of shares $d+1$. Yet, a practical drawback of both algorithms is that their safe instantiation relies on finding matrices satisfying certain conditions. In their work, Bela\\\"id et al only address these up to $d=2$ and 3 for the first and second algorithm respectively, limiting so far the practical us"},"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":"1805.08532","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.CR","submitted_at":"2018-05-22T12:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"d9f4d45413b76cb0b6ff4c799d88a93e1b66e550ceb1ff5da4bb2fba72fbf833","abstract_canon_sha256":"05c34b2f0a1ed6293c8c1c6cf8ff94dfdb62fdedade9530196d4785e71f16db9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:26.149714Z","signature_b64":"x44paEuHwfbSAcCfr/6BuqUmVxrUFcuGPcjWF34/F6FnKlGbRkY4H9/Lqu8kRkgWdr5SpzM98A+E/yLxqfOEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81cd7943e8304a2e550e6dfcd02d60ca3d5200fa7581b4fe8ba0d1c6ec74d81d","last_reissued_at":"2026-05-18T00:15:26.148926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:26.148926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Instantiations of the CRYPTO 2017 Masking Schemes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Daniel S. Roche, Pierre Karpman","submitted_at":"2018-05-22T12:03:51Z","abstract_excerpt":"At CRYPTO 2017, Bela\\\"id et al presented two new private multiplication algorithms over finite fields, to be used in secure masking schemes. To date, these algorithms have the lowest known complexity in terms of bilinear multiplication and random masks respectively, both being linear in the number of shares $d+1$. Yet, a practical drawback of both algorithms is that their safe instantiation relies on finding matrices satisfying certain conditions. In their work, Bela\\\"id et al only address these up to $d=2$ and 3 for the first and second algorithm respectively, limiting so far the practical us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08532","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":"1805.08532","created_at":"2026-05-18T00:15:26.149059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08532v1","created_at":"2026-05-18T00:15:26.149059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08532","created_at":"2026-05-18T00:15:26.149059+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHGXSQ7IGBFC","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHGXSQ7IGBFC4VIO","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHGXSQ7I","created_at":"2026-05-18T12:32:46.962924+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/QHGXSQ7IGBFC4VIONX6NALLAZI","json":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI.json","graph_json":"https://pith.science/api/pith-number/QHGXSQ7IGBFC4VIONX6NALLAZI/graph.json","events_json":"https://pith.science/api/pith-number/QHGXSQ7IGBFC4VIONX6NALLAZI/events.json","paper":"https://pith.science/paper/QHGXSQ7I"},"agent_actions":{"view_html":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI","download_json":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI.json","view_paper":"https://pith.science/paper/QHGXSQ7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08532&json=true","fetch_graph":"https://pith.science/api/pith-number/QHGXSQ7IGBFC4VIONX6NALLAZI/graph.json","fetch_events":"https://pith.science/api/pith-number/QHGXSQ7IGBFC4VIONX6NALLAZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI/action/storage_attestation","attest_author":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI/action/author_attestation","sign_citation":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI/action/citation_signature","submit_replication":"https://pith.science/pith/QHGXSQ7IGBFC4VIONX6NALLAZI/action/replication_record"}},"created_at":"2026-05-18T00:15:26.149059+00:00","updated_at":"2026-05-18T00:15:26.149059+00:00"}