{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006532285,0.0002403844,0.0002517008,0.0001759911,0.0007028888,0.0006071363,0.001933778,0.00008364754,0.000051053],"category_scores_gemma":[0.000005803593,0.0002519832,0.0000725443,0.0008724393,0.00004318327,0.000664896,0.0003566629,0.0004416356,0.00001180892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004141765,"about_ca_system_score_gemma":0.00007382734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002392243,"about_ca_topic_score_gemma":0.000170385,"domain_scores_codex":[0.9973786,0.0002326883,0.0003612228,0.001024927,0.0005322801,0.000470227],"domain_scores_gemma":[0.9971147,0.0004102845,0.00008931968,0.002088512,0.0001081092,0.000189048],"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.0002963291,0.004056269,0.009204893,0.003639808,0.001465155,0.0008466502,0.07342182,0.3422635,0.04484499,0.02695568,0.000433433,0.4925715],"study_design_scores_gemma":[0.000663347,0.000048792,0.003454235,0.0002414146,0.00002799792,0.00004919655,0.0007279149,0.9895982,0.003999341,0.0001280988,0.0007425863,0.0003188451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3974036,0.0001711897,0.6014043,0.0002873934,0.0002966876,0.000121849,0.0000667757,0.0001538909,0.0000943331],"genre_scores_gemma":[0.9608773,0.00005097266,0.03843458,0.0005245943,0.00005067799,0.000002627307,0.00004206194,0.00001429796,0.000002876628],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6473348,"threshold_uncertainty_score":0.9999933,"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."}}