{"id":"W2766560436","doi":"10.1007/978-3-319-78813-5_17","title":"Achieve Efficient and Privacy-Preserving Proximity Detection Scheme for Social Applications","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"","keywords":"Computer science; Scheme (mathematics); Polygon (computer graphics); Overhead (engineering); Information sensitivity; Plaintext; Service provider; Service (business); Encryption; Data mining; Information retrieval; Computer security; Computer network; 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.000976089,0.000699093,0.001137786,0.000996621,0.001746405,0.001566825,0.001717686,0.001375182,0.001976004],"category_scores_gemma":[0.003536778,0.0003655618,0.000843606,0.001960638,0.0007474903,0.003116399,0.004987837,0.00156998,0.0009785006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008157328,"about_ca_system_score_gemma":0.001479147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008908097,"about_ca_topic_score_gemma":0.0007961975,"domain_scores_codex":[0.9977351,0.0004985278,0.0001218502,0.0004536643,0.0009002908,0.0002905465],"domain_scores_gemma":[0.9985589,0.0004040948,0.0000955483,0.0005681317,0.0002903632,0.00008288897],"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.0008125691,0.0005076821,0.002613046,0.0005784838,0.0001762399,0.0005660185,0.001073137,0.06688491,0.07222582,0.3074025,0.02238511,0.5247745],"study_design_scores_gemma":[0.00008612499,0.0002800132,0.0009465884,0.00003100372,0.00009328367,0.001204722,0.0002794093,0.7709998,0.04995278,0.1522305,0.02380744,0.00008819657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02809398,0.0005873846,0.9649387,0.0003815569,0.00009459438,0.0001858032,0.0002285076,0.0009856303,0.004503829],"genre_scores_gemma":[0.7032307,0.0006878988,0.2844326,0.0002852518,0.0001309423,0.0002779451,0.0005819967,0.00006698368,0.0103057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001976004,"threshold_uncertainty_score":0.006610394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03158712250297908,"score_gpt":0.2605676804123062,"score_spread":0.2289805579093271,"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."}}