{"id":"W1777764582","doi":"10.1007/978-3-540-75551-7_7","title":"Pairing-Based Onion Routing","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Pairing; Directory; Anonymity; Computer network; Cryptography; Key (lock); Reduction (mathematics); Protocol (science); Theoretical computer science; Distributed computing; Algorithm; Computer security; Mathematics","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.001587784,0.0007611064,0.001375132,0.001358459,0.001713992,0.002368604,0.001627395,0.001067113,0.01125668],"category_scores_gemma":[0.003232965,0.0004154045,0.0007414706,0.001657661,0.001168901,0.0036137,0.004509033,0.001775024,0.002811126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000898289,"about_ca_system_score_gemma":0.00101083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005560017,"about_ca_topic_score_gemma":0.0008957449,"domain_scores_codex":[0.9982035,0.0005831324,0.0001091965,0.0002558222,0.000469412,0.0003788779],"domain_scores_gemma":[0.9974959,0.0005651408,0.0001100584,0.00139019,0.0002858665,0.0001526964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001394665,0.0003912462,0.0009586684,0.0001866257,0.00009876591,0.0002020962,0.0003566938,0.06221979,0.0130346,0.5477653,0.02295218,0.3504393],"study_design_scores_gemma":[0.0001896928,0.0003492566,0.0004295668,0.00006764105,0.00008508527,0.000368298,0.0001391394,0.3733411,0.01675219,0.5762893,0.03191576,0.00007297967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06297778,0.0007325585,0.8629687,0.0008468497,0.0009018123,0.0003852188,0.0004160111,0.003957899,0.06681315],"genre_scores_gemma":[0.7671155,0.0006018476,0.1955159,0.0003490095,0.0003154349,0.0002689277,0.0009072616,0.000514693,0.03441144],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01125668,"threshold_uncertainty_score":0.03765732,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02135806625240727,"score_gpt":0.2510423715049971,"score_spread":0.2296843052525898,"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."}}