{"id":"W1484103301","doi":"10.1007/978-3-642-20728-0_8","title":"Common Randomness and Secret Key Capacities of Two-Way Channels","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Randomness; Upper and lower bounds; Computer science; Channel (broadcasting); Key (lock); Channel capacity; Binary number; Theoretical computer science; Coding (social sciences); Information theory; Cryptography; Key generation; Binary erasure channel; Binary symmetric channel; Channel code; Adversary; Information-theoretic security; Algorithm; Discrete mathematics; Mathematics; Computer network; Decoding methods; Computer security; Arithmetic; Statistics","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.000437274,0.0003083148,0.0005346569,0.0004531381,0.00006843053,0.0000644857,0.0009851736,0.000217523,0.00002299325],"category_scores_gemma":[0.00001712794,0.0003030993,0.00005522759,0.0001405288,0.00117589,0.000187551,0.0003777373,0.0005510097,0.000002261665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006634347,"about_ca_system_score_gemma":0.00003462599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000700822,"about_ca_topic_score_gemma":0.000122979,"domain_scores_codex":[0.9987516,0.00002516742,0.000371316,0.0003169382,0.0002913862,0.0002435613],"domain_scores_gemma":[0.9986176,0.0002878722,0.0001163354,0.0008036987,0.000109539,0.00006493569],"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.00006148081,0.000057666,0.0002753243,0.001361427,0.0001216409,0.0000403267,0.04312379,0.06253272,0.003650292,0.1414768,0.0001031984,0.7471953],"study_design_scores_gemma":[0.001298486,0.0001789783,0.00008248603,0.002356046,0.00003469106,0.00009301858,0.000002619204,0.2991389,0.1063877,0.5865327,0.002356372,0.001538005],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005531108,0.002100717,0.9819141,0.00004138533,0.0004764179,0.0003276145,0.00001608602,0.0003006416,0.009291956],"genre_scores_gemma":[0.9649786,0.0004983575,0.03426908,0.00007663636,0.00008580009,0.00001157132,0.000006282201,0.00004102258,0.00003260779],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9594476,"threshold_uncertainty_score":0.9999421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02068454533193444,"score_gpt":0.2345175810610365,"score_spread":0.213833035729102,"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."}}