{"id":"W4379033843","doi":"10.1109/tifs.2023.3282133","title":"Efficient and Privacy-Preserving Arbitrary Polygon Range Query Scheme Over Dynamic and Time-Series Location Data","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Science Basic Research Program of Shaanxi Province; Higher Education Discipline Innovation Project; Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Range query (database); Polygon (computer graphics); Homomorphic encryption; Location-based service; Encryption; Query optimization; Query expansion; Web query classification; Data mining; Ciphertext; Web search query; Theoretical computer science; Information retrieval; Database; Computer security; Computer network; Search engine","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004629953,0.0001837863,0.0001682676,0.0003244422,0.0003714018,0.0003550119,0.002532999,0.0001438598,0.000005719725],"category_scores_gemma":[0.0003816888,0.0001829979,0.00002020345,0.0006259255,0.0001843495,0.003064166,0.001796843,0.000297215,0.00002082388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003654513,"about_ca_system_score_gemma":0.00004547025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006151065,"about_ca_topic_score_gemma":0.00002420371,"domain_scores_codex":[0.9987533,0.00003392714,0.0003243506,0.0003440656,0.0002921967,0.0002521435],"domain_scores_gemma":[0.996755,0.0001252767,0.0001162867,0.002840111,0.00007962827,0.00008371335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007082641,0.0005716345,0.001692991,0.004072063,0.0007160984,0.00004079322,0.02458618,0.006360747,0.001901359,0.05695139,0.1926717,0.7097268],"study_design_scores_gemma":[0.0003522335,0.00005000593,0.001339521,0.00006031184,0.00001064354,0.00001917608,0.000112657,0.9669947,0.0003224856,0.02952689,0.001008252,0.0002031413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2632746,0.000155823,0.7281821,0.006166245,0.000438234,0.0003916187,0.0003644998,0.0008654646,0.000161407],"genre_scores_gemma":[0.9522808,0.0007714846,0.04644413,0.0002451457,0.00001894217,0.00002568803,0.0001826341,0.00001328439,0.00001793284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9606339,"threshold_uncertainty_score":0.7462437,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01676451796040629,"score_gpt":0.2501808607666379,"score_spread":0.2334163428062316,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}