{"id":"W2951843693","doi":"","title":"Pairing-Based Onion Routing with Improved Forward Secrecy.","year":2008,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Anonymity; Routing (electronic design automation); Secrecy; Directory; Computer network; Identity (music); Node (physics); Key (lock); Scheme (mathematics); Computer security; Static routing; Multipath routing; Forward secrecy; Routing protocol; Public-key cryptography; Mathematics; Encryption; Engineering","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.001906772,0.0006704358,0.0006580744,0.0007786081,0.001525552,0.00197268,0.001387825,0.001170255,0.005683762],"category_scores_gemma":[0.003326419,0.0003124478,0.0009163612,0.0009622992,0.00194087,0.006517208,0.005991852,0.002759283,0.001890371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001005731,"about_ca_system_score_gemma":0.0009288804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000272809,"about_ca_topic_score_gemma":0.0002819359,"domain_scores_codex":[0.9970999,0.001043115,0.0001712968,0.0003815865,0.0009494283,0.0003546846],"domain_scores_gemma":[0.9975521,0.0006413116,0.0002561958,0.001188586,0.0002370242,0.0001248133],"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.0003178978,0.00008534564,0.0004040879,0.0002170624,0.00006214821,0.000299603,0.0004705184,0.01500005,0.01070854,0.908278,0.005407328,0.0587495],"study_design_scores_gemma":[0.0001462823,0.0004243828,0.0004088825,0.0001343168,0.0001347995,0.001276836,0.0002439189,0.1042489,0.04620541,0.6741529,0.172499,0.0001243302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02300432,0.0007987939,0.9239144,0.00110138,0.0007826217,0.0002630898,0.0002336838,0.000766406,0.04913521],"genre_scores_gemma":[0.717905,0.001388139,0.2389727,0.000893643,0.0005539196,0.0004610526,0.0006490562,0.0002778143,0.03889864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005683762,"threshold_uncertainty_score":0.01901406,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01322077861218972,"score_gpt":0.2339532425312448,"score_spread":0.220732463919055,"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."}}