{"id":"W2907648450","doi":"","title":"EzPC: Programmable, Efficient, and Scalable Secure Two-Party Computation for Machine Learning","year":2017,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Scalability; Secure multi-party computation; Compiler; Computation; Oblivious transfer; Theoretical computer science; Programming language; Operating system","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009408733,0.0005710804,0.0007960285,0.0003727208,0.001002117,0.0006832863,0.001671017,0.0003435829,0.000009230802],"category_scores_gemma":[0.0003065223,0.0005679144,0.0003103134,0.000137058,0.0006398862,0.0002160456,0.004622873,0.001569398,0.00002210461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003704047,"about_ca_system_score_gemma":0.0001917917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001978907,"about_ca_topic_score_gemma":0.0002819451,"domain_scores_codex":[0.9962436,0.0003876289,0.0005499767,0.001709627,0.0002874246,0.0008217405],"domain_scores_gemma":[0.9968334,0.000664636,0.000740014,0.001288277,0.0001990418,0.0002746218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000114727,0.000205216,0.007100722,0.0003411405,0.000170659,0.00003183691,0.002311439,0.01225545,0.0001198344,0.9426728,0.000305389,0.03437074],"study_design_scores_gemma":[0.0009452646,0.0001283918,0.001797399,0.00009864802,0.00004651779,0.00005132444,0.00002298042,0.413925,0.0001176039,0.576708,0.005728128,0.0004308386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04260921,0.0006971655,0.9518229,0.0008191063,0.0009184218,0.001549631,0.0002721052,0.0003968843,0.0009145249],"genre_scores_gemma":[0.1848669,0.0001380158,0.813667,0.00007956054,0.0001589811,0.0003400833,0.000712495,0.00003540789,0.000001575865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4016695,"threshold_uncertainty_score":0.9996772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202174771668337,"score_gpt":0.2977916640176854,"score_spread":0.275769916301002,"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."}}