{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XUFXIZLWGR3QS6OU55OM67DTUF","short_pith_number":"pith:XUFXIZLW","schema_version":"1.0","canonical_sha256":"bd0b74657634770979d4ef5ccf7c73a152501dbe25290451b0ff96e8576d6d44","source":{"kind":"arxiv","id":"1908.09032","version":4},"attestation_state":"computed","paper":{"title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Vipin Singh Sehrawat, Yvo Desmedt","submitted_at":"2019-08-23T20:37:10Z","abstract_excerpt":"We define a pseudorandom function (PRF) $F: \\mathcal{K} \\times \\mathcal{X} \\rightarrow \\mathcal{Y}$ to be bi-homomorphic when it is fully Key homomorphic and partially Input Homomorphic (KIH), i.e., given $F(k_1, x_1)$ and $F(k_2, x_2)$, there is an efficient algorithm to compute $F(k_1 \\oplus k_2, x_1 \\ominus x_2)$, where $\\oplus$ and $\\ominus$ are (binary) group operations. The homomorphism on the input is restricted to a fixed subset of the input bits, i.e., $\\ominus$ operates on some pre-decided $m$-out-of-$n$ bits, where $|x_1| = |x_2| = n$, and the remaining $n-m$ bits are identical in b"},"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":"1908.09032","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-08-23T20:37:10Z","cross_cats_sorted":[],"title_canon_sha256":"bb93f214d3d5c91688adae0610a4d9878d94f96e2eb6d17ef28b252eb3587e00","abstract_canon_sha256":"8e1c9ed68530323da062dd636eba115bcc9eea1c6ba9702c56faeab9ee5c7969"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:48.579366Z","signature_b64":"jjAsgRzv5PgeaxAVJDW0hr/YrYbZcGRc89zVK66VXnTjFapFgxEJz3SmOha03tffyiHjC1yMBYPcuM/7vdnxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0b74657634770979d4ef5ccf7c73a152501dbe25290451b0ff96e8576d6d44","last_reissued_at":"2026-07-05T01:28:48.578905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:48.578905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Vipin Singh Sehrawat, Yvo Desmedt","submitted_at":"2019-08-23T20:37:10Z","abstract_excerpt":"We define a pseudorandom function (PRF) $F: \\mathcal{K} \\times \\mathcal{X} \\rightarrow \\mathcal{Y}$ to be bi-homomorphic when it is fully Key homomorphic and partially Input Homomorphic (KIH), i.e., given $F(k_1, x_1)$ and $F(k_2, x_2)$, there is an efficient algorithm to compute $F(k_1 \\oplus k_2, x_1 \\ominus x_2)$, where $\\oplus$ and $\\ominus$ are (binary) group operations. The homomorphism on the input is restricted to a fixed subset of the input bits, i.e., $\\ominus$ operates on some pre-decided $m$-out-of-$n$ bits, where $|x_1| = |x_2| = n$, and the remaining $n-m$ bits are identical in b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09032","kind":"arxiv","version":4},"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/1908.09032/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":"1908.09032","created_at":"2026-07-05T01:28:48.578978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09032v4","created_at":"2026-07-05T01:28:48.578978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09032","created_at":"2026-07-05T01:28:48.578978+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUFXIZLWGR3Q","created_at":"2026-07-05T01:28:48.578978+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUFXIZLWGR3QS6OU","created_at":"2026-07-05T01:28:48.578978+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUFXIZLW","created_at":"2026-07-05T01:28:48.578978+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/XUFXIZLWGR3QS6OU55OM67DTUF","json":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF.json","graph_json":"https://pith.science/api/pith-number/XUFXIZLWGR3QS6OU55OM67DTUF/graph.json","events_json":"https://pith.science/api/pith-number/XUFXIZLWGR3QS6OU55OM67DTUF/events.json","paper":"https://pith.science/paper/XUFXIZLW"},"agent_actions":{"view_html":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF","download_json":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF.json","view_paper":"https://pith.science/paper/XUFXIZLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09032&json=true","fetch_graph":"https://pith.science/api/pith-number/XUFXIZLWGR3QS6OU55OM67DTUF/graph.json","fetch_events":"https://pith.science/api/pith-number/XUFXIZLWGR3QS6OU55OM67DTUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF/action/storage_attestation","attest_author":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF/action/author_attestation","sign_citation":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF/action/citation_signature","submit_replication":"https://pith.science/pith/XUFXIZLWGR3QS6OU55OM67DTUF/action/replication_record"}},"created_at":"2026-07-05T01:28:48.578978+00:00","updated_at":"2026-07-05T01:28:48.578978+00:00"}