{"id":"W4323519519","doi":"10.1109/tdsc.2023.3253786","title":"Multi-Client Secure and Efficient DPF-Based Keyword Search for Cloud Storage","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Bloom filter; Encryption; Server; Cloud computing; Computer network; Cloud storage; Hash function; Distributed computing; Computer security","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.0009017985,0.0006408143,0.001694006,0.0008524042,0.001731313,0.001632362,0.002903337,0.001269413,0.003062299],"category_scores_gemma":[0.002564352,0.0003782776,0.0006709734,0.001895692,0.0008663193,0.004918371,0.00296724,0.001010632,0.001170062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002090207,"about_ca_system_score_gemma":0.002299174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871587,"about_ca_topic_score_gemma":0.002099512,"domain_scores_codex":[0.9976254,0.0003166974,0.000208395,0.0003313808,0.00114472,0.0003735253],"domain_scores_gemma":[0.9975847,0.0003785376,0.0002256539,0.001069237,0.0005838793,0.0001579213],"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.004322436,0.0004730092,0.005018565,0.001177212,0.0003022859,0.002369668,0.00100972,0.1398212,0.1527327,0.1309125,0.01930057,0.54256],"study_design_scores_gemma":[0.0001380264,0.0002612091,0.0006347174,0.00003806064,0.00005932944,0.001654016,0.0002010123,0.9002414,0.06374465,0.02334669,0.009550161,0.0001307278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07823107,0.002008415,0.9095502,0.0005276416,0.0001289888,0.0004209653,0.000348038,0.00448629,0.004298435],"genre_scores_gemma":[0.8779344,0.000383081,0.1167995,0.0001485649,0.00005198003,0.0002071174,0.000247201,0.00008442415,0.004143607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003062299,"threshold_uncertainty_score":0.01516557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02852156470290198,"score_gpt":0.2746016577552661,"score_spread":0.2460800930523641,"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."}}