{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006505312,0.0005249671,0.0004891261,0.0008586564,0.0003371998,0.000674405,0.002024025,0.0002695078,0.00003350734],"category_scores_gemma":[0.00003312948,0.0004941131,0.0001503747,0.0004320721,0.0009574289,0.0006166409,0.0008120234,0.0009538942,0.00001911308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001740996,"about_ca_system_score_gemma":0.000315653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002233491,"about_ca_topic_score_gemma":0.00005247618,"domain_scores_codex":[0.9964461,0.00003499457,0.0004727134,0.001570435,0.0008826862,0.0005930137],"domain_scores_gemma":[0.9981542,0.0004915974,0.0001123808,0.0009046278,0.0001268151,0.0002103279],"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.000007516224,0.0000496422,0.0000491931,0.0000425141,0.00001546895,0.00009031229,0.0009153342,0.01019043,0.00002742209,0.7660505,0.00001150737,0.2225502],"study_design_scores_gemma":[0.0008037727,0.0005437887,0.001104281,0.001016901,0.00001294445,0.0001569402,4.184394e-7,0.1204903,0.0006009179,0.8736416,0.0006154809,0.001012614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008563199,0.0003004773,0.9954301,0.0004836276,0.0008414073,0.0003059656,0.00004937648,0.0001559893,0.00157676],"genre_scores_gemma":[0.8740885,0.00003601162,0.1237934,0.001720201,0.0003011886,0.000003005065,0.00002808347,0.00002261436,0.000007016979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8732322,"threshold_uncertainty_score":0.999751,"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."}}