{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00342639,0.001339646,0.001414011,0.002380253,0.001317727,0.005186196,0.002351035,0.002420361,0.008661152],"category_scores_gemma":[0.01938535,0.001088144,0.001164068,0.003158228,0.006447577,0.009445891,0.003521146,0.005270333,0.001003049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003031547,"about_ca_system_score_gemma":0.0017567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008878109,"about_ca_topic_score_gemma":0.0004345565,"domain_scores_codex":[0.9956713,0.001478199,0.0001849287,0.0004869376,0.001453797,0.000724949],"domain_scores_gemma":[0.9715954,0.0235753,0.0009297004,0.002309203,0.001087954,0.0005025007],"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.00006453319,0.00001192254,0.00005419082,0.00005963048,0.00001099582,0.00003613524,0.0001251883,0.01170831,0.0005826123,0.9829109,0.0009350996,0.003500514],"study_design_scores_gemma":[0.0000174827,0.000009545849,0.00006186487,0.00002800514,0.000007114706,0.00005648072,0.00002719927,0.0217829,0.0005277001,0.976447,0.001016519,0.0000182523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1820837,0.006896448,0.625646,0.004410469,0.000320201,0.0002112925,0.001354144,0.0004134397,0.1786643],"genre_scores_gemma":[0.9548436,0.003275428,0.02491793,0.0002585829,0.0003981502,0.0004831275,0.0004280152,0.0002035147,0.01519157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008661152,"threshold_uncertainty_score":0.02897441,"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."}}