{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001067531,0.0006696283,0.0006850018,0.0009577405,0.0004768519,0.0009323902,0.002903532,0.0004108924,0.00001228387],"category_scores_gemma":[0.0001613509,0.000634496,0.0002957149,0.0008274807,0.0006984493,0.0004787725,0.001107775,0.000742019,0.00006755459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002859582,"about_ca_system_score_gemma":0.0004676513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003688471,"about_ca_topic_score_gemma":0.00004881748,"domain_scores_codex":[0.9951472,0.00004898194,0.0007089957,0.002089178,0.001101193,0.0009044993],"domain_scores_gemma":[0.996389,0.0009701634,0.0004029945,0.001399569,0.0005438438,0.00029437],"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.000007410737,0.0001528828,0.00003653832,0.0001459884,0.00002461009,0.00002760185,0.0008179181,0.1046619,0.0001592098,0.06470755,0.0001889168,0.8290694],"study_design_scores_gemma":[0.000560128,0.0001501681,0.0002025209,0.0002181578,0.00001098466,0.00002044233,1.670239e-7,0.8565022,0.0002536756,0.1398457,0.001539786,0.0006960263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005466269,0.0003554497,0.9933574,0.0003218078,0.002374784,0.001443338,0.00008179245,0.0002456761,0.001273123],"genre_scores_gemma":[0.3046769,0.00003166801,0.6925364,0.002004073,0.000502081,0.00007632934,0.00008659923,0.00005025515,0.0000358058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8283734,"threshold_uncertainty_score":0.9996107,"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."}}