{"id":"W1562018356","doi":"10.1007/978-3-540-30539-2_36","title":"Strong Conditional Oblivious Transfer and Computing on Intervals","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oblivious transfer; Predicate (mathematical logic); Computer science; Generalization; Simple (philosophy); Theoretical computer science; Modular design; Modular construction; Transfer (computing); Algorithm; Discrete mathematics; Mathematics; Cryptography; Programming language; 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.001015087,0.0005691498,0.001085435,0.0009056152,0.001212578,0.002648019,0.001508075,0.0007216822,0.00731524],"category_scores_gemma":[0.004947955,0.0004573647,0.0009282446,0.002323933,0.00298903,0.007512181,0.002754714,0.00376755,0.001169558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001529564,"about_ca_system_score_gemma":0.0007425075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004357801,"about_ca_topic_score_gemma":0.0002480597,"domain_scores_codex":[0.9987611,0.0002907659,0.00006606028,0.0002133687,0.0004249993,0.0002436391],"domain_scores_gemma":[0.9963566,0.002133902,0.0001763957,0.0009924847,0.0002040234,0.0001365977],"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.00006007701,0.00001195016,0.0000453974,0.00003398945,0.000004680353,0.00001902483,0.000085354,0.002965901,0.0005622861,0.9846267,0.0009435932,0.01064107],"study_design_scores_gemma":[0.0000115351,0.00001881681,0.00005467551,0.000009924198,0.000007533748,0.00003057994,0.00001374775,0.01335437,0.001068562,0.9833836,0.002039378,0.000007305449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09338938,0.001337036,0.8303856,0.001352472,0.0002690564,0.00008365855,0.0002642637,0.001005343,0.0719131],"genre_scores_gemma":[0.8935573,0.0009927419,0.07525618,0.0002677055,0.0004063518,0.0001979689,0.0002555404,0.000327468,0.02873865],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00731524,"threshold_uncertainty_score":0.02447194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01740736196155751,"score_gpt":0.2486044370477504,"score_spread":0.2311970750861929,"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."}}