{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009318979,0.002828424,0.003605024,0.004318055,0.004305296,0.008724344,0.007124541,0.004992643,0.01497412],"category_scores_gemma":[0.0349224,0.002270197,0.003638669,0.006586495,0.01065232,0.02949717,0.01278429,0.02200998,0.002992754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005763104,"about_ca_system_score_gemma":0.002348385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008942338,"about_ca_topic_score_gemma":0.001022105,"domain_scores_codex":[0.991082,0.002930194,0.0004191948,0.001320149,0.003023159,0.001225427],"domain_scores_gemma":[0.9646041,0.02736058,0.0008970208,0.004034796,0.001849102,0.001254355],"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.00005782914,0.00003848576,0.00007233863,0.00007117991,0.000009221812,0.0000224212,0.00009071835,0.001614947,0.000264091,0.9873076,0.002186505,0.008264598],"study_design_scores_gemma":[0.00001174817,0.00001489179,0.0000508774,0.00002469009,0.00001525539,0.0000395477,0.00001505893,0.01559623,0.0002419266,0.9820766,0.001897141,0.0000160415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03676206,0.00767865,0.7832944,0.009833223,0.001231241,0.0002169945,0.0005582158,0.001010652,0.1594145],"genre_scores_gemma":[0.6839465,0.007037093,0.2358766,0.003371032,0.004327719,0.001023972,0.000663501,0.001267702,0.06248579],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01497412,"threshold_uncertainty_score":0.05009341,"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."}}