{"id":"W2405322972","doi":"10.1007/s00446-016-0284-9","title":"Secure multi-party computation in large networks","year":2016,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Asynchronous communication; Computer science; Scalability; Computation; Protocol (science); Theory of computation; Latency (audio); Distributed computing; Security parameter; Secure multi-party computation; Communication complexity; Adversary; Fraction (chemistry); Theoretical computer science; Computer network; Cryptography; Computer security; Algorithm","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.004331241,0.0005143351,0.001119282,0.0007085679,0.001673935,0.002925932,0.001238896,0.001434228,0.002696089],"category_scores_gemma":[0.01330685,0.0006061664,0.0004812014,0.001242141,0.002649223,0.006094757,0.003820467,0.002832748,0.0007258049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144804,"about_ca_system_score_gemma":0.001180804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004141552,"about_ca_topic_score_gemma":0.0006011379,"domain_scores_codex":[0.9960479,0.001714978,0.0002229575,0.0004120373,0.001270018,0.000332091],"domain_scores_gemma":[0.9869039,0.008218803,0.0006475733,0.003406185,0.0005034608,0.0003201767],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00085955,0.0001641373,0.00132036,0.0002740836,0.00007855255,0.0003652848,0.0003553989,0.3086933,0.01069212,0.5884505,0.004713621,0.0840332],"study_design_scores_gemma":[0.00005248529,0.00003017932,0.0001591762,0.00001431765,0.00001389268,0.00007405884,0.00003604456,0.6604809,0.003504924,0.3329959,0.002628034,0.0000100963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06454403,0.001043197,0.9246077,0.002406449,0.0001646031,0.00009417348,0.00007102935,0.000514693,0.006554221],"genre_scores_gemma":[0.9157827,0.0006869574,0.07572972,0.000151495,0.0001861193,0.0001588419,0.00009696493,0.00009701932,0.007110169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004331241,"threshold_uncertainty_score":0.02290606,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01360963221056115,"score_gpt":0.2581931113703358,"score_spread":0.2445834791597746,"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."}}