{"id":"W1833038439","doi":"10.1007/11535218_28","title":"New Monotones and Lower Bounds in Unconditional Two-Party Computation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Oblivious transfer; Computation; Protocol (science); String (physics); Theoretical computer science; Reduction (mathematics); Context (archaeology); Upper and lower bounds; Secure multi-party computation; Transfer (computing); Scheme (mathematics); Algorithm; Mathematics; Parallel computing","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.0005680227,0.0004461879,0.0004262821,0.001033431,0.0001980555,0.00069429,0.001428923,0.000232982,0.00003759724],"category_scores_gemma":[0.000028702,0.0004403183,0.00009314685,0.0007323568,0.0005291782,0.001292511,0.0008971466,0.0006833873,0.00002023126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001645551,"about_ca_system_score_gemma":0.0005457021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001151532,"about_ca_topic_score_gemma":0.0009252556,"domain_scores_codex":[0.9967931,0.00003070785,0.0004922636,0.001397618,0.0007736135,0.0005127259],"domain_scores_gemma":[0.9984442,0.0003438114,0.0002042179,0.0006754131,0.0001126187,0.0002197174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001531371,0.0000582777,0.0004935222,0.00002312558,0.00000998192,0.00009281291,0.0008663671,0.02680751,0.00003081554,0.1972522,0.00019292,0.7741572],"study_design_scores_gemma":[0.0007210445,0.0001265821,0.002393303,0.0002180496,0.000005465174,0.00008835763,1.750475e-7,0.2915496,0.0001014104,0.7004985,0.00364349,0.0006540091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007188957,0.0005506617,0.994981,0.0008574547,0.001079853,0.0002787015,0.00002416222,0.00009848657,0.001410779],"genre_scores_gemma":[0.2188215,0.00006812585,0.7786127,0.001589496,0.0007507007,0.00000738118,0.00006979603,0.00002478675,0.00005550084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7735031,"threshold_uncertainty_score":0.9998049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01201170104009166,"score_gpt":0.2529135174642392,"score_spread":0.2409018164241476,"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."}}