{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000700468,0.0001216581,0.0002471276,0.0003091064,0.00008172359,0.00004420812,0.0007069391,0.0001271919,0.00009744496],"category_scores_gemma":[0.00008675046,0.00009934636,0.0001880996,0.0004124111,0.00008820678,0.0003775161,0.00003732293,0.0004079179,0.00001706013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003210514,"about_ca_system_score_gemma":0.00009373139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001793689,"about_ca_topic_score_gemma":0.00002425331,"domain_scores_codex":[0.9986719,0.00007170985,0.0004721964,0.0001591532,0.0003412037,0.0002838646],"domain_scores_gemma":[0.9988,0.0004170909,0.0001445211,0.000246289,0.0002268795,0.0001651654],"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.0001182812,0.0002060659,0.000586548,0.000005320127,0.00004731967,0.0004304017,0.0002058755,0.00003671825,0.0004253247,0.9887594,0.006975766,0.002203004],"study_design_scores_gemma":[0.002404923,0.001783917,0.06076983,0.00005042854,0.00003800618,0.002696717,0.00006534407,0.0001548115,0.00272662,0.882361,0.04660703,0.0003413956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1893546,0.0001283514,0.8080574,0.001189485,0.0006304546,0.00003731683,0.00003276798,0.00002231711,0.0005473551],"genre_scores_gemma":[0.9837294,0.00002185285,0.01511743,0.0009562118,0.0001555962,4.763074e-7,0.00001357583,0.000004607403,8.669572e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7943748,"threshold_uncertainty_score":0.4051227,"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."}}