{"id":"W2189936489","doi":"10.1007/978-3-642-38553-7_15","title":"Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Homomorphic encryption; Mathematical proof; Multiplication (music); Protocol (science); Theoretical computer science; Arithmetic; Covert; Commitment scheme; Encryption; Cryptography; Algorithm; Computer security; Mathematics; Combinatorics","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.001596158,0.0009516412,0.001498778,0.0008120048,0.001706407,0.004015956,0.001818057,0.002220858,0.009122844],"category_scores_gemma":[0.00536267,0.0006020037,0.001427448,0.001158588,0.001800758,0.005749143,0.005055523,0.004038676,0.002431364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737824,"about_ca_system_score_gemma":0.001104603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001730794,"about_ca_topic_score_gemma":0.0003405837,"domain_scores_codex":[0.9969062,0.0006662307,0.0001280138,0.000497456,0.001258126,0.0005439739],"domain_scores_gemma":[0.9971135,0.001455268,0.0001359063,0.001042495,0.0001616149,0.00009122858],"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.0004783943,0.0001441306,0.0002823415,0.0002099509,0.00009943772,0.0001913312,0.0001987032,0.02970146,0.01412824,0.8701448,0.009678528,0.07474266],"study_design_scores_gemma":[0.000068515,0.00008063007,0.0001862697,0.00005102788,0.00004995146,0.0001726149,0.00002993621,0.1638694,0.01121872,0.8179585,0.00628688,0.00002756504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1189703,0.001580649,0.7523434,0.004462316,0.00076175,0.0003665815,0.0005666744,0.001637774,0.1193107],"genre_scores_gemma":[0.8858135,0.0005776901,0.0863135,0.0004781965,0.0003839292,0.0003047597,0.0003727213,0.0002847674,0.02547085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009122844,"threshold_uncertainty_score":0.03051895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0180807366372732,"score_gpt":0.2468778288586794,"score_spread":0.2287970922214062,"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."}}