{"id":"W4395960800","doi":"10.1007/978-3-031-58751-1_10","title":"Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Oblivious transfer; Transfer (computing); Theoretical computer science; Parallel computing; Algorithm; Cryptography","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009978402,0.0009096583,0.0007102162,0.001242491,0.0003314198,0.001859175,0.004258195,0.0003762533,0.00004128047],"category_scores_gemma":[0.00001548546,0.0007260477,0.0002516913,0.001534049,0.001205259,0.001160751,0.001135187,0.001673856,0.000102472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001657135,"about_ca_system_score_gemma":0.0006047549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008303584,"about_ca_topic_score_gemma":0.0006382927,"domain_scores_codex":[0.9945617,0.00004622493,0.0005644684,0.002592783,0.001204009,0.001030827],"domain_scores_gemma":[0.9969515,0.0003671989,0.0001102694,0.002025488,0.000232975,0.000312605],"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.00004652167,0.00007987639,0.00004574643,0.0001391773,0.00007665365,0.001417408,0.00285051,0.01569597,0.0001298652,0.8659561,0.00006314588,0.113499],"study_design_scores_gemma":[0.001414287,0.001335784,0.00012465,0.00176561,0.0001085782,0.001124669,0.000001606141,0.3457122,0.001800124,0.6335903,0.009823331,0.00319881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005043049,0.001176205,0.9903613,0.0007678207,0.001724253,0.0005378729,0.0000574476,0.0004396973,0.004431115],"genre_scores_gemma":[0.4421984,0.0002280691,0.5519444,0.003600345,0.001278628,0.00004269415,0.00005541651,0.000161475,0.000490544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4416941,"threshold_uncertainty_score":0.9995191,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01109857582949954,"score_gpt":0.2330085209114828,"score_spread":0.2219099450819833,"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."}}