{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389352,0.0001803531,0.0002151926,0.0003267701,0.000209443,0.0004612117,0.0008611595,0.00009271153,0.0001473812],"category_scores_gemma":[0.0001856516,0.0001561617,0.00008323181,0.001184503,0.00003012102,0.003701942,0.00006925673,0.000698178,0.0002175433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007642392,"about_ca_system_score_gemma":0.0001606012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001739844,"about_ca_topic_score_gemma":0.000002465649,"domain_scores_codex":[0.9981794,0.0002895806,0.0006547126,0.0001533881,0.0004527745,0.0002701684],"domain_scores_gemma":[0.9986683,0.0002646602,0.0003530952,0.0003061325,0.0001653928,0.0002424734],"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.001310961,0.0005338059,0.01217279,0.00005369989,0.0002076949,0.0001072064,0.02013325,0.002778507,0.000532922,0.8324991,0.08632907,0.04334097],"study_design_scores_gemma":[0.008342291,0.00186564,0.03962232,0.0004927891,0.00004475005,0.0002340428,0.002411334,0.1907482,0.01288607,0.5788125,0.1627191,0.001820946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3242505,0.000194283,0.6656477,0.002670807,0.001266001,0.0003497876,0.0001373411,0.0003223074,0.005161332],"genre_scores_gemma":[0.9903243,0.0000931222,0.003226008,0.006053196,0.0002071569,0.000008227767,0.00007893162,0.000007025975,0.000002055102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6660738,"threshold_uncertainty_score":0.636809,"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."}}