{"id":"W2921249631","doi":"10.1109/tifs.2019.2903651","title":"Secure Approximate String Matching for Privacy-Preserving Record Linkage","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Bloom filter; Computer science; Homomorphic encryption; Approximate string matching; Encryption; Matching (statistics); Theoretical computer science; String searching algorithm; String (physics); Protocol (science); Record linkage; Computer security; Cryptography; Data mining; Pattern matching; Computer network; Artificial intelligence; Mathematics","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.007680241,0.0004270196,0.001321137,0.001335967,0.001691933,0.003842819,0.002450314,0.002587152,0.002480808],"category_scores_gemma":[0.02304981,0.0006241912,0.001067838,0.002706573,0.002812809,0.008857016,0.007874255,0.00274355,0.001167015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001860201,"about_ca_system_score_gemma":0.002624803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002943419,"about_ca_topic_score_gemma":0.0002139896,"domain_scores_codex":[0.9850726,0.004999279,0.001386819,0.00171362,0.005887142,0.0009405406],"domain_scores_gemma":[0.9776484,0.007104347,0.002407938,0.01095243,0.001430649,0.0004561455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001148746,0.0003508953,0.002268678,0.0003262371,0.0001465648,0.0006577907,0.001385081,0.08436114,0.03601588,0.7024463,0.00392432,0.1669684],"study_design_scores_gemma":[0.0001813967,0.0003847996,0.000665351,0.00008444666,0.00008764807,0.001064847,0.0003551827,0.4716568,0.08994923,0.4224768,0.01297169,0.0001219016],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03512928,0.000188442,0.9603829,0.0005886473,0.00004816808,0.0001613557,0.0001503629,0.0006703744,0.002680477],"genre_scores_gemma":[0.7144869,0.0002588819,0.2803369,0.0003163753,0.00009260027,0.0003457486,0.0003383716,0.000117341,0.003706875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007680241,"threshold_uncertainty_score":0.04061747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009779452813707932,"score_gpt":0.2227051968258481,"score_spread":0.2129257440121402,"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."}}