{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0108517,0.002463367,0.003811055,0.002403157,0.003667965,0.01175564,0.005404988,0.004763193,0.01072458],"category_scores_gemma":[0.05149627,0.001815489,0.001753418,0.004805,0.01509358,0.03980013,0.01079114,0.02023803,0.003557595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004800451,"about_ca_system_score_gemma":0.002338156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009592925,"about_ca_topic_score_gemma":0.0006330524,"domain_scores_codex":[0.9899141,0.003696076,0.0004736455,0.001564346,0.003345574,0.00100618],"domain_scores_gemma":[0.9318614,0.05546353,0.001747326,0.00722213,0.002703241,0.001002396],"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.00007979968,0.00002167436,0.00004755441,0.00009563476,0.00001156155,0.00002369272,0.0001201918,0.006932555,0.0003267178,0.9780844,0.00321726,0.01103893],"study_design_scores_gemma":[0.00001061932,0.00001325203,0.00002028755,0.00004655604,0.000008488752,0.00002380368,0.00002284912,0.02215919,0.0003740324,0.9738007,0.003505327,0.00001495609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006412303,0.01091252,0.9113547,0.007163213,0.001399821,0.00006991297,0.0002362105,0.0003920141,0.06205931],"genre_scores_gemma":[0.6494655,0.02309159,0.2782878,0.003397529,0.00744745,0.0008907868,0.0006032834,0.001562284,0.0352538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01175564,"threshold_uncertainty_score":0.05738991,"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."}}