{"id":"W1489319061","doi":"10.1007/3-540-39200-9_35","title":"New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer science; Secrecy; Upper and lower bounds; Shared secret; Key (lock); Theoretical computer science; Context (archaeology); Fraction (chemistry); Information theory; Mutual information; Adversary; Pre-shared key; Key distribution; Public-key cryptography; Algorithm; Cryptography; Mathematics; Computer security; Encryption; Statistics; Artificial intelligence","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.0005913775,0.000251133,0.0002335818,0.000417357,0.0001161555,0.0002293073,0.0006647186,0.0002351479,0.0000197129],"category_scores_gemma":[0.00002414128,0.0002234386,0.00003329141,0.0002729956,0.0001624987,0.0004959956,0.0001742482,0.0007794636,0.000005544091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002954302,"about_ca_system_score_gemma":0.00005726338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004593675,"about_ca_topic_score_gemma":0.0003372027,"domain_scores_codex":[0.9987249,0.00003101815,0.0003618166,0.0002879169,0.0003468139,0.0002474733],"domain_scores_gemma":[0.9989272,0.0002408136,0.0001018332,0.0006206239,0.0000481449,0.00006143659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002205885,0.000005207536,0.0001627191,0.00008475596,0.00001001164,0.000003510381,0.003045571,0.01176835,0.0003517366,0.007272049,0.0001542599,0.9771397],"study_design_scores_gemma":[0.0005850903,0.0001277485,0.001701494,0.001324886,0.00002996373,0.00008376551,0.000003571117,0.492074,0.01258491,0.439517,0.050574,0.001393618],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006262096,0.001014029,0.9921645,0.0004874096,0.0002045852,0.0003416598,0.000003478054,0.0001414573,0.00501665],"genre_scores_gemma":[0.8347348,0.0011808,0.1630228,0.0005176554,0.0003019635,0.00002075972,0.00003690493,0.00005875049,0.0001254932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.975746,"threshold_uncertainty_score":0.9111562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0237777613687142,"score_gpt":0.2571438290335551,"score_spread":0.2333660676648409,"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."}}