{"id":"W280815280","doi":"10.1007/978-3-319-17470-9_2","title":"Generalizing Efficient Multiparty Computation","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Oblivious transfer; Computer science; Verifiable secret sharing; Compiler; Mathematical proof; Overhead (engineering); Computation; Transformation (genetics); Theoretical computer science; Transfer (computing); Focus (optics); Secure multi-party computation; Protocol (science); Construct (python library); Communication source; Algorithm; Parallel computing; Programming language; Mathematics; Computer network; Set (abstract data type)","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.001330857,0.001433052,0.001443653,0.001371951,0.001195651,0.002505914,0.002210394,0.001425732,0.01257073],"category_scores_gemma":[0.004083213,0.0007899345,0.002212323,0.002095897,0.002436648,0.006420156,0.006491793,0.006517869,0.004805541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001654669,"about_ca_system_score_gemma":0.0006165325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004458893,"about_ca_topic_score_gemma":0.0004837815,"domain_scores_codex":[0.998342,0.0003879281,0.00007839633,0.0003359668,0.0006352832,0.0002203007],"domain_scores_gemma":[0.9982556,0.0005427945,0.00005437388,0.0009696858,0.0001232406,0.00005435024],"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.00002085732,0.00002100283,0.00003450919,0.00008027088,0.00001478648,0.00002765323,0.00005188454,0.005877971,0.001236144,0.9656422,0.003295819,0.02369699],"study_design_scores_gemma":[0.000006001231,0.000006364142,0.00004027494,0.00002114969,0.000007548155,0.00003627478,0.000005448348,0.01798286,0.0007655237,0.9684436,0.01267772,0.000007293311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01052217,0.001455075,0.8482741,0.001437357,0.0007439975,0.0001425926,0.0002960973,0.001116264,0.1360124],"genre_scores_gemma":[0.4772465,0.005320318,0.3676586,0.001543391,0.001859102,0.0007900186,0.001504287,0.002429885,0.1416479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01257073,"threshold_uncertainty_score":0.04205328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03537981676386553,"score_gpt":0.2746430159340184,"score_spread":0.2392631991701528,"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."}}