{"id":"W3134872094","doi":"10.1109/tsc.2021.3065240","title":"Achieving Efficient and Privacy-Preserving Set Containment Search Over Encrypted Data","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Services Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Encryption; Bloom filter; Set operations; Cloud computing; Containment (computer programming); Set (abstract data type); Outsourcing; Tree (set theory); Computer security; Data mining; Database; Computer network","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666618,0.0004404746,0.001337381,0.001010411,0.001024062,0.001621011,0.001354364,0.0008107434,0.001387497],"category_scores_gemma":[0.006141267,0.0002932836,0.0007822221,0.002618009,0.0009165037,0.005641903,0.002938293,0.001158091,0.000715213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000932948,"about_ca_system_score_gemma":0.002177018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009768328,"about_ca_topic_score_gemma":0.0008584691,"domain_scores_codex":[0.9961342,0.000652377,0.0004129337,0.0004191461,0.001856474,0.0005249224],"domain_scores_gemma":[0.9943835,0.001849251,0.0006869409,0.002185636,0.0007608359,0.0001339077],"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.001683325,0.0007425571,0.006196034,0.001012032,0.0002895365,0.001335915,0.001813472,0.1297772,0.1287923,0.2503318,0.01512758,0.4628982],"study_design_scores_gemma":[0.00018319,0.0006120132,0.001646904,0.00008423973,0.0001350164,0.002971667,0.0006756647,0.7485768,0.131637,0.09650094,0.01686266,0.0001138479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1157701,0.001302649,0.8734059,0.0007557003,0.00007268816,0.0002579062,0.0006296199,0.0009879806,0.006817496],"genre_scores_gemma":[0.8026969,0.0009055262,0.1921119,0.0002725531,0.00007362461,0.0001566134,0.0007863702,0.00005430551,0.002942266],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001666618,"threshold_uncertainty_score":0.008814037,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0349615736369783,"score_gpt":0.2928322967017207,"score_spread":0.2578707230647425,"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."}}