{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007215617,0.0002683999,0.0002731068,0.0003917125,0.001017726,0.0003069717,0.0003816713,0.00013741,0.000007091997],"category_scores_gemma":[0.000007075839,0.0002614706,0.0001399701,0.0009366655,0.00008717357,0.0001681304,0.00002341727,0.0004066686,0.00001242837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003025658,"about_ca_system_score_gemma":0.00007111459,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000504044,"about_ca_topic_score_gemma":0.00006347501,"domain_scores_codex":[0.9978973,0.0001041493,0.0002975334,0.0007862737,0.0003240649,0.0005907039],"domain_scores_gemma":[0.9986341,0.0005161116,0.00006674923,0.0004472041,0.0001020525,0.0002337597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002699662,0.001342764,0.0002371357,0.0008888062,0.0002135913,0.0001520445,0.01374066,0.8472229,0.002976534,0.01257895,0.001258756,0.1191179],"study_design_scores_gemma":[0.001431704,0.000211731,0.00020557,0.00008395132,0.00002208691,0.00001880082,0.0002677414,0.9915587,0.00415536,0.0001261477,0.001601966,0.000316191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2617852,0.0001398983,0.7363454,0.0002458938,0.000649307,0.0003949864,0.0001063537,0.0003180713,0.00001487177],"genre_scores_gemma":[0.9705299,0.00003837703,0.02910708,0.0001789883,0.00007008273,0.00002138167,0.00001736905,0.00002183747,0.00001504318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7087446,"threshold_uncertainty_score":0.9999837,"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."}}