{"as_of":"2026-08-16T09:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb87e54aea24ab6bbf57dced5acc636f9b91c2b055111abfc23e72cb7e0331bb","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:31:13.139766Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.09032/citation-record","integrity":"/paper/1908.09032/integrity","json":"/paper/1908.09032/citation-record.json","paper":"/paper/1908.09032"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.217107Z","title":"Functional Encryption for Inner Product Predicat es from Learning with Errors","venue":null,"work_id":"c39bfc6a-c3fb-4aa8-9236-c79e7844ac2e","year":2011},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.787280Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:67bce696da991da9be0b786881bfdd719c0c1fba31767eedb031fda4f00a56ba","observation_id":"72dc37c5-9b3d-4e2b-b046-8fcd4f02ed34","resolution":{"observed_at":"2026-08-14T11:31:14.224108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.200261Z","title":"S imultaneous hardcore bits and cryptography against memory attacks","venue":null,"work_id":"322fe65a-040a-4cc6-9269-78f8ffdccbe4","year":2009},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.793602Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:fffd5a7a77cebd982e4f7db3a568303f30d56b8583e1c1fa42a406d97e93cd62","observation_id":"e2897ee2-6fc6-43c0-a931-770dabc5d5f6","resolution":{"observed_at":"2026-08-14T11:31:14.205336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.184878Z","title":"Learning with Rounding, Revisited","venue":null,"work_id":"a8830a26-15c7-4695-abea-23f94525d08f","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.798551Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:0088b854897f85a5b964843878abd64aeb8eb8e36dc79a26abea2c4e5c77221f","observation_id":"2f7c1f40-7358-4451-b726-1888aba9e45e","resolution":{"observed_at":"2026-08-14T11:31:14.189732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.168721Z","title":"Protecting data using client-side encryption, 2 006","venue":null,"work_id":"eb1f1b85-5fee-41dc-9586-c5b373a3b672","year":null},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.803728Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:163cc39940bb631065c41f2b0af863ec73ff7f860a2b24b74b6654329b40c1d6","observation_id":"00e4378e-ed38-4b5d-a0bc-d38504b8e4db","resolution":{"observed_at":"2026-08-14T11:31:14.173824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.153446Z","title":"Fast Cryptographic Primitives and Circular-Secure En- cryption Based on Hard Learning Problems","venue":null,"work_id":"4eab599f-8bb6-4789-9f17-91e37a728998","year":2009},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.809172Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:01f761a60fed2d1cc7764bd43def9fe75fd10f88741dd740039194d600120bb2","observation_id":"978f375a-f117-40e6-a191-54aca37fb2ce","resolution":{"observed_at":"2026-08-14T11:31:14.158435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.136487Z","title":"Key-homomorphic cons trained pseudorandom functions","venue":null,"work_id":"0eb93452-7146-43ef-bd37-20076f70ff21","year":2015},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.814400Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:1eff7d167a78306fa583f208049aaf9a7e08acd5205153b892f53b291e82326c","observation_id":"0986c236-63da-4d6e-90b3-bc91e3b997a2","resolution":{"observed_at":"2026-08-14T11:31:14.142368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.119802Z","title":"New and Improved Key -Homomorphic Pseudorandom Functions","venue":null,"work_id":"90dd3cbb-005f-4b71-8be1-a008a69a9b9e","year":2014},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.820236Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:3f9fcc18e54e376a9b25fd36e9cf38967c9df276aed4e57a5887e26909de6bf1","observation_id":"c6a2ccd3-846d-4613-a803-d6e721cfc535","resolution":{"observed_at":"2026-08-14T11:31:14.125184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.102382Z","title":"Pseudo random functions and lattices","venue":null,"work_id":"2c87c906-5769-40ae-8faa-8514e0b26a05","year":2012},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.826568Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:3ef921e820000b631cef545e9098b2b488f770a0cde591f3e0452a4050cb794f","observation_id":"3f58a916-7615-4aee-ac07-c06c44dfa28d","resolution":{"observed_at":"2026-08-14T11:31:14.108176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.085066Z","title":"Bellare, R","venue":null,"work_id":"76736a8c-8ec8-4f1a-81e7-958d60ce2196","year":1996},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.832779Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:d9a80d238401193bfa806cb48e3363ac4a4239a36119dfd29d8be70e2bb3fed0","observation_id":"3eff51c2-218a-45f5-90fb-57b138510f59","resolution":{"observed_at":"2026-08-14T11:31:14.090078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.060766Z","title":"On the construction o f variable-input-length ciphers","venue":null,"work_id":"764a50c2-d37f-49dd-8491-77926dcc1804","year":1999},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.837716Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:7df69ada1404f573ede4770304a3fa0a3e36dfe2f549eaef0564ecfe7d2d2544","observation_id":"51161650-fb5b-400b-b6b6-735a28401702","resolution":{"observed_at":"2026-08-14T11:31:14.071104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.042887Z","title":"Saarinen, Ludo Tolhuizen, and Zhenfei Zhang","venue":null,"work_id":"7771064f-4316-4014-859f-30eeb667f375","year":2019},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.842840Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:95d8eeb204b7cc33cf14ef7567ccb49178f8378736b21fd763651dcfeace9d19","observation_id":"9f372770-9ce9-4c57-ba0b-d40b0e2f8ace","resolution":{"observed_at":"2026-08-14T11:31:14.048659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.023447Z","title":"On the Hardness of Learning with Rounding over Small Modulus","venue":null,"work_id":"91db6c5d-3843-4e6e-95fe-a21908ee1a15","year":2016},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.848468Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:4fd9fa2cfc4e3ea0ef588253635112bf20d49ea2a50e15e5b3417820b0dc84a4","observation_id":"8c664351-37e3-43db-9e43-c67a913e07ab","resolution":{"observed_at":"2026-08-14T11:31:14.028597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:14.001696Z","title":"Key homomorphic PRFs and their applications","venue":null,"work_id":"e8ae248c-b13a-4a1c-beab-f3fa5dcd0484","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.853761Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:7557ef8250261a29c247408e5cbf46cef759b06952c24edd5da85ea988182385","observation_id":"db70edb5-ebca-4fc4-800d-ccf8c1c6d361","resolution":{"observed_at":"2026-08-14T11:31:14.007679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.980841Z","title":"Constrained pseudorandom fu nctions and their applications","venue":null,"work_id":"4c50bb27-9b89-4400-9361-6c75e86877b9","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.858337Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:bc1aea3862d2b1737d0c911346cca10674b4b4d001faf2f93f32f8121a4f8eeb","observation_id":"a5cb6957-7895-4032-a096-d2ac50337235","resolution":{"observed_at":"2026-08-14T11:31:13.987306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.962810Z","title":"Function al Signatures and Pseudorandom Functions","venue":null,"work_id":"c7a385ec-8ae8-49b1-b2da-948c5f3738f3","year":2014},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.863162Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:a4d2172e84fc0af4c4085468bf0f71f1cb4ae282ba3cea531c7ae0c5bf6e31cf","observation_id":"4e669e94-3ef1-4621-961f-c4743881ae52","resolution":{"observed_at":"2026-08-14T11:31:13.969579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.944859Z","title":"Classical hardness of learning wi th errors","venue":null,"work_id":"5f489535-5d8e-4c4f-8e44-ed977ba9e7e9","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.867994Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:13b7adfd3885c3f87fee2d89d82eb63da9dbebbf47f4cd60c282f8209d623dd9","observation_id":"b08d33aa-f643-4ff4-aa10-8d09fc81e80b","resolution":{"observed_at":"2026-08-14T11:31:13.950029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.925684Z","title":"Fully Homomo rphic Encryption from Ring-L WE and Security for Key Depen- dent Messages","venue":null,"work_id":"ff405b80-dbc7-4afa-aba0-351d363bdc7d","year":2011},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.872932Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:dc2219b36c0461b998bc2b66715e7830975c76a28d152bcf28a7153e027cc634","observation_id":"cda9deae-b9e8-4df1-9048-e9575a13aa45","resolution":{"observed_at":"2026-08-14T11:31:13.931545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.908020Z","title":"Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions – or: How to Secretly Embed a Circuit in Your PRF","venue":null,"work_id":"bf7cfb47-8f4a-4843-ad51-53cba412257a","year":2015},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.878093Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:2899f9e1c1a020ad67915e0ffd55d820d866972cc911e72687ce6354806b2718","observation_id":"39b2f6e5-cee5-4ba4-b047-a707d39fe552","resolution":{"observed_at":"2026-08-14T11:31:13.913860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.891789Z","title":"Privacy pres erving keyword searches on remote encrypted data","venue":null,"work_id":"75a42d2d-3550-4aee-b418-99e9a0383c62","year":2005},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.882799Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:57d2eebcc285d1b3dda72b3eae7379f636c6308c0124f5dfdcd45fa154633640","observation_id":"e72b540c-27b2-4745-9a49-bb5773eaccf0","resolution":{"observed_at":"2026-08-14T11:31:13.897114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.875525Z","title":null,"venue":null,"work_id":"83095af5-6528-43d9-8c5c-7058198dd015","year":2017},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.887824Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:066bcb849140c16c6ac7500b7e2e18c800c33893df06c070e05f17597d1a61ec","observation_id":"612df50a-972d-4453-9292-db424d8be22d","resolution":{"observed_at":"2026-08-14T11:31:13.880386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.855982Z","title":"Searchable symmetric encryption: improved definitio ns and efficient constructions","venue":null,"work_id":"c90e85bf-838e-4492-bd06-3d4c09bb3699","year":2006},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.892826Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:241adb6767d7ceac9b183f540747275729b767b2a88253379a7e5c8326e9f988","observation_id":"826feaa0-305e-49fa-a8be-57d1a4eecf2a","resolution":{"observed_at":"2026-08-14T11:31:13.864564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.835458Z","title":"Saber: Module-L WR based key exchange, CPA-secure encryption and CCA-secure kem","venue":null,"work_id":"753fc15c-1125-4612-9266-bf89954ed265","year":2018},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.897709Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:b4cca9c185e5477289f39391d2eabd019503685bbdbc4177b6fa9467fc40ecb6","observation_id":"559c6fbe-b263-4618-8ddf-a4d953ff8d43","resolution":{"observed_at":"2026-08-14T11:31:13.842066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.819030Z","title":"Everspaugh, K.G","venue":null,"work_id":"046a9a06-e5c1-4fd2-bdad-bde6bb29683d","year":2017},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.902832Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:475ee12793a5a6dcbd8e37285b76bba55849956268c4e8baf81a8ad1c8d045b9","observation_id":"5a571820-0e49-41b8-9825-9ec0e130ed51","resolution":{"observed_at":"2026-08-14T11:31:13.824159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.803746Z","title":"Trapdoors for hard lattices and new cryptograp hic constructions","venue":null,"work_id":"8557db60-5467-4c77-9137-9ef3f9179b07","year":2008},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.907956Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:099a839afd8943573db47ab37d4b40b36216278e1fad5109e748869f17432ee3","observation_id":"9a951c38-34b8-4bf0-a566-f604be8127ed","resolution":{"observed_at":"2026-08-14T11:31:13.808702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.788350Z","title":"Secure indexes","venue":null,"work_id":"69a44103-bd4b-45c3-9885-309b9c7549cf","year":2003},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.913012Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:e24fd38a06b074156ed2bae73eaca198b925342b4280f9f8e6b5ea3e5e3839d2","observation_id":"a401550e-69a6-4dfe-aee1-061ffce061c7","resolution":{"observed_at":"2026-08-14T11:31:13.792858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.772718Z","title":"How to construct random functions","venue":null,"work_id":"d03a52e4-6b0f-42eb-a6cd-ed9776b9ccf0","year":1986},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.918657Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:97a3fb6ce62b21f55d93ee2f5ab59e1ac0c090fbf1330bef2129442157e32290","observation_id":"6ee59259-a660-4e8a-98d6-d1ac2b89d798","resolution":{"observed_at":"2026-08-14T11:31:13.778229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.755203Z","title":"Reusable garbled circ uits and succinct functional encryption","venue":null,"work_id":"ad31db54-4b63-475e-a0d3-9229c6d79f3a","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.923597Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:fcc1369841e36109caa4bfeb3dc3f34048e0d290c9c6685ecd8b1b0317ba157b","observation_id":"2401d942-37a4-41b1-b269-64cb635516d3","resolution":{"observed_at":"2026-08-14T11:31:13.760620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.735980Z","title":"Managing data encryption, 2019","venue":null,"work_id":"52e7d832-73cd-48b1-9f10-b65ccaa9af7f","year":2019},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.928434Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:48ae593c3f8d4f07ff98e3cd1ad350e899f43a5596a077cdc5b1542340d9d847","observation_id":"7fb914c8-da69-469c-9f99-a28e44ab38fb","resolution":{"observed_at":"2026-08-14T11:31:13.741163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.718645Z","title":null,"venue":null,"work_id":"a09cb8b8-2352-489f-ad03-54ed791b848a","year":2001},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.934023Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:3b71718d8302967e2f0c79a5f8d12a5c92b4e612c9c20d3ecc1b1ab0930a8669","observation_id":"600b444b-7842-49e6-9946-1e3bf03cdf36","resolution":{"observed_at":"2026-08-14T11:31:13.724145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.699282Z","title":"Juels and S","venue":null,"work_id":"8c514bbe-43f9-4d56-9f4b-d9349e0d1b73","year":2005},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.940161Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:5942aaaa1123bb3bb498dd6238cdfd5758aa18b36f296cd2cc574af49abbe973","observation_id":"ff63fa0a-de17-4c00-8992-5de28040c904","resolution":{"observed_at":"2026-08-14T11:31:13.706857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.681790Z","title":"Parallel and D ynamic Searchable Symmetric Encryption","venue":null,"work_id":"137b7143-da99-477d-8b24-fd2d116a6caa","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.945961Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:449bb03b50b94021e9eaaa81afaea209e31e9ac5d0f95be4ad3e42d6cf1dab6b","observation_id":"d16fb9e9-b7b9-40aa-9f5a-0f3285b060cb","resolution":{"observed_at":"2026-08-14T11:31:13.686860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.665595Z","title":"D ynamic searchable symmetric encryption","venue":null,"work_id":"9b328804-5eb8-4329-b3a4-22f668956b65","year":2012},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.951709Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:0552cf76b0c3f805c52a0e1bdd8257dbe781000ccd51efa62261bb7632d3e5f9","observation_id":"c2f044ac-913b-4b3e-bc47-e8c23de3b318","resolution":{"observed_at":"2026-08-14T11:31:13.670613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.650113Z","title":"Katz, J.S","venue":null,"work_id":"ca29256b-e832-4d7c-a50c-35ef426375be","year":2010},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.957388Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:b777dedcc4f0951b7283e036e3924ddad3ec8a28a458355ced1f6f930195d52d","observation_id":"1736c650-3138-4305-9b61-52b2a45b2b8f","resolution":{"observed_at":"2026-08-14T11:31:13.654677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.634858Z","title":"Smooth project ive hashing and password-based authenticated key exchange from lattices","venue":null,"work_id":"f5c1d270-6656-4fdd-802d-e71f0b4eb73f","year":2009},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.964674Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:9f4771505dbcd2cd364eb027d1841ce1642528b5d6f1fa3835adea3e20306a9c","observation_id":"238642cd-7300-41f6-9f9b-0c7e2193f2e9","resolution":{"observed_at":"2026-08-14T11:31:13.640065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.619834Z","title":"Delegatable pseudorandom fun ctions and applications","venue":null,"work_id":"6555e75c-b4eb-4b3b-a38d-b373d38a54ac","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.975981Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:d4c1b438a573b07c14d83f937f92bd42d9fafe1eca6f6e660dcff8ea3713cb8f","observation_id":"b3fe18dd-e9c5-46b6-9dc1-cdc0d25b4793","resolution":{"observed_at":"2026-08-14T11:31:13.624736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.604020Z","title":"Kiltz, K","venue":null,"work_id":"07b245a9-1f77-4082-9d30-bfe9dbc086b0","year":2011},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.983349Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:90450ac29190c2806a7eb6d175ee5a898fd6123833e64bc7aec553291ca9a84a","observation_id":"e1888acc-da80-49d9-8b1d-09d4d3a99900","resolution":{"observed_at":"2026-08-14T11:31:13.609051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.588386Z","title":"UC-Secure searchab le symmetric encryption","venue":null,"work_id":"e8e323db-2c54-453e-b4a1-bbe0d73b7b52","year":2012},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.993062Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:6dceacc60f77402dcb5bc54eafa8753daf83ac41e57d5a381922bc1ddff70d53","observation_id":"f7ce4042-28c5-4a93-91b6-34953f1fce48","resolution":{"observed_at":"2026-08-14T11:31:13.593510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.570636Z","title":"Updatable encryption w ith post-compromise security","venue":null,"work_id":"c8feae47-2234-4c24-81c9-e42704f0dd9a","year":2018},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:12.999343Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:ed951adabac5170deff5e729a112eb1d5d5742eaaf06c0f2b305a349b9e86ee8","observation_id":"6e2c6d3c-1bf8-4e2a-b909-25242d5396b5","resolution":{"observed_at":"2026-08-14T11:31:13.577047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.553353Z","title":"Computationally Efficient Search able Symmetric Encryption","venue":null,"work_id":"df01e63c-dfb4-42db-9359-210f766234c9","year":2010},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.010867Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:250cf0239148f1d5ca5cb2f783393e315a51c77a2b9792128c5e5ed09519819b","observation_id":"374ac0ef-d13e-49ca-8a27-bd3ae39dd103","resolution":{"observed_at":"2026-08-14T11:31:13.559485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.533711Z","title":"Fiat-shamir with aborts: Applicat ions to lattice and factoring-based signatures","venue":null,"work_id":"0d943506-0ab9-4088-a567-e29ef6225182","year":2009},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.018973Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:e06d7640850039257f1bc29667731383321470b834bdbd469460a060f452f5df","observation_id":"d329fcab-b448-4b31-9fc5-7318c881a445","resolution":{"observed_at":"2026-08-14T11:31:13.539733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.509229Z","title":"Lattice Signatures without Trapdo ors","venue":null,"work_id":"6611e854-ab49-4a80-86d9-d052a05fab5f","year":2012},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.027608Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:2e196071d92c01a236f8a201e364a23a734f45360e304c6a0386fa498e2cf5b1","observation_id":"f8816fdf-3beb-4730-95de-87f730546c6a","resolution":{"observed_at":"2026-08-14T11:31:13.514606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.489633Z","title":"On id eal lattices and learning with errors over rings","venue":null,"work_id":"29113a3a-bb39-4553-8c98-a72ce60e5743","year":2010},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.036109Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:f719aecfb8c5b2d4a6d4e726f2dad1380184eff93943f3e072dd4238b501e9b4","observation_id":"353a304a-1dea-456a-9ae0-1efbab3374cc","resolution":{"observed_at":"2026-08-14T11:31:13.495783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.471518Z","title":"Hardness of sis an d lwe with small parameters","venue":null,"work_id":"b0c5547a-e134-416d-a62e-db3b3026572c","year":2013},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.042273Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:624b212784a023d04137f904d74daef89e6a2f181956a9037ccd91b7f76ea3d7","observation_id":"ecca25c4-5731-4e24-aa51-8b7a806d1005","resolution":{"observed_at":"2026-08-14T11:31:13.477123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.453416Z","title":"Distributed Pseudo-random Functions and KDCs","venue":null,"work_id":"2fedf116-8e31-4fc4-9ea9-93b1044e8c8b","year":1999},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.049247Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:e6482182df6c09a7df847a45dea66af9a8088c8fff6df18ee7bf3f3bf2aaca05","observation_id":"f1fe7250-b00b-4d7b-9700-8f7c0ef0d327","resolution":{"observed_at":"2026-08-14T11:31:13.458814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.429440Z","title":"Synthesizers and their appl ication to the parallel construction of pseudo-random func tions","venue":null,"work_id":"5e5f9dc1-a4ec-4bc2-b416-858d3181cd25","year":1999},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.055674Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:4ddda36881ed34d419c8916ab362541ad5666a1a693b814c43ff039b5ff29a2c","observation_id":"551c602e-af66-47e1-bf0c-84b563d0efd7","resolution":{"observed_at":"2026-08-14T11:31:13.440479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.409359Z","title":"A noiseless key-homomorphic prf: Application on distribut ed storage systems","venue":null,"work_id":"be2bbbd2-b399-447a-b3ac-edf624dbd43d","year":2016},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.061212Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:3928bf916741a6bad5fc125fcea17e03ae3ed89f0e3518d6fd2c0f79d42bab22","observation_id":"de982d11-6d15-48a4-8023-d303acc2757c","resolution":{"observed_at":"2026-08-14T11:31:13.417201Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.389340Z","title":"Public-key cryptosystems from the worst -case shortest vector problem","venue":null,"work_id":"ee5b7818-242d-437c-bab7-45f791dcaf1c","year":2009},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.071364Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:8020fd11b17b4d08dd4ddc6c4aaae336e04696349ed8c45b51013764b3c40ce6","observation_id":"ab7eb2d2-fcfe-4156-a9fd-561c5fbc964a","resolution":{"observed_at":"2026-08-14T11:31:13.395530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.368990Z","title":"Efficient collision-resist ant hashing from worst-case assumptions on cyclic lattices","venue":null,"work_id":"0d6ac15a-abe3-41d7-bd9c-7c7bfb89d8f1","year":2006},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.078060Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:6ebe43b3540fb445639588246efbee2ba4627abe35830e37484284b098da71b3","observation_id":"0a3cddbc-0d28-4bc9-8673-0d44a2b2e7a4","resolution":{"observed_at":"2026-08-14T11:31:13.376234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.348580Z","title":"A Framework for Efficient and Composable Oblivious Transfer","venue":null,"work_id":"721aa39a-0a91-49d6-8198-2db3d2d1cf94","year":2008},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.082981Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:5e9fbe3df3d3d4b310ed9f7ea5e9e0a42fa15885422fec69052a14bdfe3aeb0a","observation_id":"513a1c43-116a-445b-a6d7-6ad70af6f670","resolution":{"observed_at":"2026-08-14T11:31:13.354669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.327135Z","title":"Pietrzak","venue":null,"work_id":"0b30972e-c650-4ebc-be69-5cb0a4dfd16a","year":2012},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.088219Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:a0d674b209efc9fbc91b04b8d5890291190d731fabd2d420d08ea442249aa6da","observation_id":"5f6036b9-000b-4265-86a9-a4532e49429b","resolution":{"observed_at":"2026-08-14T11:31:13.333282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.304185Z","title":"On lattices, learning with errors, random li near codes, and cryptography","venue":null,"work_id":"fe6f97c8-3141-4001-9215-88644df118c1","year":2005},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.093430Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:1fc26372625f31bdbe3f49c75b01bc1f66461acb675f6430ebe6ae871a503548","observation_id":"e714019c-9520-4dad-80d9-7207eae99b1c","resolution":{"observed_at":"2026-08-14T11:31:13.310655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.285122Z","title":"Lattice-based blind signatures","venue":null,"work_id":"6a99e689-af47-466b-8862-6fc1dc18fd59","year":2010},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.101493Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:862ac7f69e100fb05a5c4b6e99565facce168485703dde4ae6d034abd05c984c","observation_id":"9ba67dc4-3475-4c07-91de-802fadd09ca2","resolution":{"observed_at":"2026-08-14T11:31:13.290839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.268946Z","title":"Bi-Homomorphic La ttice-Based PRFs and Unidirectional Updatable Encryption","venue":null,"work_id":"9f0ce686-1627-4a46-81dc-78b6f6b2000a","year":2019},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.115049Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:e9f98b64b3d18c2fb21742320994def91386b901a16b9fc9b2bd7ed921fa9849","observation_id":"8f1a51a7-dad5-4c37-a8b7-659ae3b9f1a9","resolution":{"observed_at":"2026-08-14T11:31:13.273971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.245114Z","title":"How to share a secret","venue":null,"work_id":"56330e5e-8341-4039-9afa-f45d4b06e522","year":1979},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.121171Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:f70ca165ce3c6758bb8e0033f4a8887ba5b83d9b9d76030f3837ca7ea89ccdaa","observation_id":"b6586359-a1ea-43a2-85b4-9332028cde9d","resolution":{"observed_at":"2026-08-14T11:31:13.256330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.218855Z","title":null,"venue":null,"work_id":"8251f5ea-59a4-48d4-a3e6-4eec7cdde70d","year":1994},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.133053Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:59df125fcceacc0319fc44258d635fcdc09ed577ed2b6f18032106fa466e2446","observation_id":"f5b521c1-c37e-41e0-bab4-5a7c0b2dc8ea","resolution":{"observed_at":"2026-08-14T11:31:13.225489Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:13.193073Z","title":"Pra ctical techniques for searches on encrypted data","venue":null,"work_id":"352a09d9-3ed4-46c5-905a-03a4cb839043","year":2000},"citing_paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption","version":4},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:13.139766Z"},"links":{"citing_paper":"/paper/1908.09032"},"observation_digest":"sha256:c6400bcf9b139a1923b3e7654d9c38b239d51772b6c2604862ca6b07a7001952","observation_id":"069b698f-d247-4fb4-8885-2373c1467468","resolution":{"observed_at":"2026-08-14T11:31:13.203029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09032","last_updated":"2020-08-21T13:32:35Z","latest_version":4,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-16T04:43:23.928016Z","submitted_at":"2019-08-23T20:37:10Z","title":"Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":53},"total_outbound_references":56},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:1908.09032."}