{"id":"W3037789107","doi":"10.1109/tdsc.2020.3004442","title":"Achieving Efficient and Privacy-Preserving Exact Set Similarity Search over Encrypted Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Dependable and Secure Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"National Key Research and Development Program of China; 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; Cloud computing; Nearest neighbor search; Data mining; Set (abstract data type); Similarity (geometry); Tree (set theory); Information privacy; Server; Theoretical computer science; Mathematics; Computer security; Artificial intelligence; Image (mathematics); 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.0006250126,0.0002734107,0.0002994347,0.0001487238,0.0008442547,0.0005468583,0.001423926,0.0001208465,0.00003419831],"category_scores_gemma":[0.00003525455,0.0002700813,0.00006436367,0.0007030146,0.00007580026,0.0007655605,0.0002891195,0.0007532323,0.000005181344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001717867,"about_ca_system_score_gemma":0.00006112406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001477282,"about_ca_topic_score_gemma":0.00003560698,"domain_scores_codex":[0.9975082,0.0001881128,0.0003278582,0.001074116,0.000420435,0.0004812421],"domain_scores_gemma":[0.9980577,0.000410067,0.00007718689,0.001052306,0.00005663443,0.0003460725],"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.0009069291,0.002476534,0.01097552,0.003486362,0.001403767,0.0009667328,0.1013054,0.2633151,0.02640892,0.01924602,0.006256895,0.5632519],"study_design_scores_gemma":[0.0006206185,0.0001149558,0.001100817,0.00008160327,0.00002893279,0.0000383414,0.0001943503,0.9948683,0.001366591,0.0001016306,0.001154182,0.000329634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3348744,0.0002305341,0.6635036,0.0007263055,0.0001363971,0.00017545,0.0001151237,0.0001777758,0.00006040971],"genre_scores_gemma":[0.9783232,0.0000887623,0.02096595,0.0005103069,0.00007065642,0.000001572521,0.00002259338,0.00001581058,0.000001107115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7315533,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05970768965338365,"score_gpt":0.2883740473154003,"score_spread":0.2286663576620167,"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."}}