{"id":"W2495523385","doi":"","title":"Resource Fairness and Composability of Cryptographic Protocols.","year":2005,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Universal composability; Composability; Impossibility; Commit; Protocol (science); Cryptography; Cryptographic primitive; Proof-of-work system; Cryptographic protocol; Computer security; Secure multi-party computation; Resource (disambiguation); Theoretical computer science; Distributed computing; Computer network; Cryptocurrency","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.007584075,0.00101212,0.0008192401,0.001264957,0.002808564,0.003066376,0.001983405,0.001662695,0.005142455],"category_scores_gemma":[0.01503761,0.0007355263,0.001794216,0.001140056,0.007982665,0.008658696,0.004299025,0.0043307,0.0008369715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002710157,"about_ca_system_score_gemma":0.002160717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001743885,"about_ca_topic_score_gemma":0.0009570982,"domain_scores_codex":[0.9930099,0.0024091,0.0005605667,0.001271353,0.002073625,0.0006755606],"domain_scores_gemma":[0.9900865,0.004880024,0.001001853,0.002880499,0.0006700585,0.0004810503],"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.00004837476,0.00001942822,0.000150714,0.00003837053,0.00001235512,0.00007881664,0.0002019057,0.007264717,0.001012638,0.9851245,0.0003232409,0.00572506],"study_design_scores_gemma":[0.0000332175,0.00004471758,0.0001159228,0.00003647839,0.00003692134,0.0001400116,0.00005491007,0.0522071,0.004379901,0.9308497,0.01208258,0.00001851257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02193255,0.0006074524,0.9503958,0.001268285,0.0002761514,0.0001615543,0.00008434457,0.0005938245,0.02468015],"genre_scores_gemma":[0.8057753,0.0005941014,0.1779431,0.0005197048,0.0004043132,0.00045487,0.0002041727,0.0003107741,0.01379378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007584075,"threshold_uncertainty_score":0.04010892,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01821921392728335,"score_gpt":0.2822069954822428,"score_spread":0.2639877815549594,"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."}}