{"id":"W161845448","doi":"10.1007/978-3-642-31410-0_6","title":"Bounds and Constructions for 1-Round (0,δ)-Secure Message Transmission against Generalized Adversary","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Secret sharing; Communication complexity; Theoretical computer science; Communication source; Adversary; Upper and lower bounds; Adversary model; Disjoint sets; Security parameter; Computer network; Cryptography; Discrete mathematics; Mathematics; Algorithm; Computer security","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.0007260491,0.0005415204,0.0005369834,0.0007021197,0.0006505601,0.000606705,0.001705693,0.0004226304,0.0000185627],"category_scores_gemma":[0.00002763368,0.0004949148,0.0002108122,0.000490107,0.001143379,0.001237169,0.0006338056,0.0006194022,0.000003597971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061443,"about_ca_system_score_gemma":0.0003409553,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001434818,"about_ca_topic_score_gemma":0.00003754267,"domain_scores_codex":[0.9968116,0.0000385875,0.0004696872,0.001367677,0.0005989309,0.0007135004],"domain_scores_gemma":[0.9978206,0.0004087233,0.000224765,0.001046798,0.0001680024,0.0003311084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001565481,0.00003505186,0.00004774742,0.00009033391,0.0000228321,0.00001379572,0.001024954,0.0003656104,0.0003124763,0.1350123,0.00007821222,0.8629811],"study_design_scores_gemma":[0.002056136,0.0003125035,0.0002377571,0.00063342,0.00007869628,0.0002741769,0.000001596414,0.2293,0.001324382,0.5918248,0.171891,0.002065502],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002773824,0.003283366,0.9922414,0.000500943,0.001436732,0.0006025485,0.00008235616,0.0001528299,0.001422467],"genre_scores_gemma":[0.05232922,0.001361716,0.9442714,0.001227301,0.0006304142,0.00002870291,0.0000767598,0.00004102387,0.0000333977],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8609155,"threshold_uncertainty_score":0.9997503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01505791732721629,"score_gpt":0.243302894587604,"score_spread":0.2282449772603877,"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."}}