{"id":"W3112250879","doi":"10.1109/tpds.2020.3042695","title":"Privacy-Preserving Similarity Search With Efficient Updates in Distributed Key-Value Stores","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Homomorphic encryption; Speedup; Encryption; Cloud computing; Hash function; Nearest neighbor search; Locality-sensitive hashing; Similarity (geometry); Key (lock); Data mining; ElGamal encryption; Leverage (statistics); Theoretical computer science; Distributed computing; Public-key cryptography; Hash table; Computer network; Computer security; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"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.004548453,0.0006867609,0.001892546,0.00132933,0.001787053,0.00370711,0.003139785,0.001600367,0.001767541],"category_scores_gemma":[0.01246906,0.0008491343,0.0007881239,0.002525043,0.001994653,0.01051792,0.006223418,0.002230319,0.0006914592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365938,"about_ca_system_score_gemma":0.002916422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001449493,"about_ca_topic_score_gemma":0.001152264,"domain_scores_codex":[0.9920398,0.001602192,0.0008734808,0.001209371,0.003427987,0.0008471478],"domain_scores_gemma":[0.9888479,0.002983424,0.001047428,0.005525007,0.001268852,0.0003274247],"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.004136888,0.00118902,0.006984875,0.0005380215,0.0003354811,0.001409352,0.00202743,0.2106755,0.08529492,0.3074641,0.007150189,0.3727942],"study_design_scores_gemma":[0.0004724305,0.0005718326,0.0007069707,0.0000411873,0.0001218601,0.0007493544,0.0003335644,0.7888406,0.07544462,0.1250663,0.007536869,0.0001144171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1263697,0.0006875673,0.8665228,0.0005413463,0.0001023813,0.000457729,0.00020976,0.002392737,0.002715912],"genre_scores_gemma":[0.8492867,0.0002360401,0.1474336,0.0001359776,0.00007429597,0.0002582008,0.000216191,0.0001002075,0.002258752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004548453,"threshold_uncertainty_score":0.02405483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0233563898907388,"score_gpt":0.239407286401864,"score_spread":0.2160508965111252,"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."}}