{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041151,0.0003787348,0.00125077,0.001006291,0.0007907611,0.001221067,0.001254255,0.0008187559,0.001110583],"category_scores_gemma":[0.003955088,0.0002535453,0.0007222521,0.002755707,0.0006430323,0.004385479,0.002358569,0.0008598685,0.00053212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007159676,"about_ca_system_score_gemma":0.001728358,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000919573,"about_ca_topic_score_gemma":0.0008199161,"domain_scores_codex":[0.9971055,0.000456148,0.0003545471,0.0003752312,0.001375419,0.000333192],"domain_scores_gemma":[0.9974511,0.0006465076,0.0003713871,0.001066942,0.0003710676,0.00009297167],"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.001798229,0.0006781578,0.00603042,0.0007492068,0.0002843606,0.001104335,0.0009332774,0.152307,0.1468862,0.1719152,0.009871519,0.5074421],"study_design_scores_gemma":[0.000163795,0.000468615,0.001419622,0.00003746559,0.00008190154,0.002363676,0.0003069482,0.8394365,0.08241216,0.06456394,0.00866589,0.00007953158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.102827,0.0007369018,0.8913261,0.0003436478,0.0000606155,0.0001777794,0.000446854,0.0005667518,0.003514213],"genre_scores_gemma":[0.818359,0.0005736884,0.1777987,0.0001392886,0.00005938258,0.0001210568,0.0006342495,0.00003090288,0.002283825],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001254255,"threshold_uncertainty_score":0.005506158,"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."}}