{"id":"W2120014373","doi":"10.1007/s00145-007-0327-2","title":"On Unconditionally Secure Distributed Oblivious Transfer","year":2007,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Oblivious transfer; Communication source; Computer science; Randomness; Server; Theoretical computer science; Impossibility; Set (abstract data type); Access structure; Secret sharing; Cryptography; Transfer (computing); Infimum and supremum; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematics; Computer network; Parallel computing","routes":{"ca_aff":true,"ca_fund":true,"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.002700117,0.001597129,0.002118762,0.001718767,0.002985807,0.003503582,0.002935315,0.002833491,0.01210138],"category_scores_gemma":[0.009258163,0.001180808,0.001196522,0.002624563,0.006719638,0.01400141,0.01232064,0.006698689,0.002738214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003208451,"about_ca_system_score_gemma":0.001918278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009627645,"about_ca_topic_score_gemma":0.0009112582,"domain_scores_codex":[0.9969341,0.0006141091,0.0001438358,0.0004401941,0.001155159,0.0007126229],"domain_scores_gemma":[0.9932652,0.004029569,0.00023565,0.0018308,0.0004190145,0.0002197692],"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.0002121186,0.0000374135,0.0001010044,0.000055222,0.00001161244,0.00007430749,0.0002134012,0.00652276,0.0008441819,0.9769866,0.002924794,0.01201659],"study_design_scores_gemma":[0.00002334593,0.00001773465,0.00004061174,0.00001799755,0.00001193881,0.00003351835,0.00001622018,0.01781431,0.000758213,0.9787418,0.002509756,0.00001452787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06455386,0.001302516,0.8357959,0.006258651,0.001166435,0.0001990676,0.0003923528,0.001748491,0.08858278],"genre_scores_gemma":[0.8915575,0.001300446,0.04820093,0.001448485,0.0008271781,0.0003740596,0.0004371307,0.0006917401,0.05516252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01210138,"threshold_uncertainty_score":0.04048318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007361256692201161,"score_gpt":0.2462951735661842,"score_spread":0.238933916873983,"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."}}