{"id":"W2982682504","doi":"10.1109/jsait.2020.3017054","title":"Erasable Bit Commitment From Temporary Quantum Trust","year":2020,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke; Université de Montréal; Perimeter Institute; University of Waterloo","funders":"Industry Canada; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Communication source; Commit; Commitment scheme; Computer science; Computer security; Protocol (science); Third party; Trusted third party; Cryptography; Cryptographic protocol; Node (physics); Adversarial system; Bit (key); Computer network; Internet privacy","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.003519869,0.000688699,0.001066196,0.000882405,0.002098212,0.003784312,0.002771341,0.002598837,0.00718681],"category_scores_gemma":[0.01189471,0.0006599884,0.001225374,0.001418119,0.006077542,0.01093238,0.008259567,0.006475473,0.002227004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001667114,"about_ca_system_score_gemma":0.001991422,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004641347,"about_ca_topic_score_gemma":0.0003585762,"domain_scores_codex":[0.9941795,0.001891075,0.0003818409,0.0007762557,0.001904829,0.0008665165],"domain_scores_gemma":[0.9912598,0.002587749,0.0007556205,0.004185092,0.0008104804,0.0004013093],"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.00008022392,0.00001951813,0.00005502037,0.00004674112,0.000007644648,0.0001329157,0.0001907722,0.005704953,0.00214341,0.9847397,0.0008841555,0.005995065],"study_design_scores_gemma":[0.00006120116,0.00009586458,0.00006982363,0.0000633416,0.00001778036,0.0002167914,0.00008987567,0.06868747,0.00587075,0.9085337,0.01622956,0.00006374519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02330752,0.0003977819,0.9491409,0.001280621,0.0003757954,0.0001778312,0.0001612318,0.0003597075,0.02479857],"genre_scores_gemma":[0.7415285,0.0007510078,0.2317031,0.001077841,0.0004103046,0.0007551354,0.0002696684,0.0003140786,0.02319028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00718681,"threshold_uncertainty_score":0.02404225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01525613646474347,"score_gpt":0.2259497649719675,"score_spread":0.210693628507224,"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."}}