{"id":"W2100684940","doi":"10.1109/ebiss.2009.5137919","title":"An Efficient Fault Tolerant Cryptosystem","year":2009,"lang":"en","type":"article","venue":"","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Cryptosystem; Computer science; Hybrid cryptosystem; Hash function; Message authentication code; Error detection and correction; Authentication (law); Fault tolerance; Overhead (engineering); Encryption; Paillier cryptosystem; Cryptography; Computer network; Theoretical computer science; Algorithm; Distributed computing; Computer security","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.0005358145,0.0004212686,0.0004723551,0.0007755972,0.0007860932,0.001056661,0.000910027,0.0007789796,0.002862455],"category_scores_gemma":[0.001041529,0.0002184842,0.0002828972,0.0006965081,0.0006498115,0.002359414,0.001180296,0.0009861017,0.0008806185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005497903,"about_ca_system_score_gemma":0.0007485507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002257314,"about_ca_topic_score_gemma":0.0001814965,"domain_scores_codex":[0.9990618,0.0001360909,0.00005904934,0.0001124227,0.0005167992,0.0001138742],"domain_scores_gemma":[0.9994414,0.0001081315,0.00006435547,0.0002355516,0.0001201325,0.00003044477],"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.0005295658,0.0002000339,0.0005042334,0.0004041431,0.00006628098,0.0005978963,0.0001716947,0.07120651,0.09380463,0.4775953,0.01292537,0.3419944],"study_design_scores_gemma":[0.0003038779,0.000518413,0.0005271364,0.00007600094,0.00009046567,0.001735042,0.0000853087,0.5897728,0.1236694,0.1952799,0.08783431,0.000107429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02891476,0.0008411311,0.9583562,0.0007857459,0.0002973644,0.0001570909,0.0001101942,0.00197514,0.008562298],"genre_scores_gemma":[0.6547091,0.001032605,0.3337381,0.0004370943,0.0002809968,0.00016814,0.0002517297,0.0001190449,0.009263309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002862455,"threshold_uncertainty_score":0.009575844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008276856055911858,"score_gpt":0.2455762267859315,"score_spread":0.2372993707300196,"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."}}