{"id":"W2952499149","doi":"10.48550/arxiv.1310.3486","title":"Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Asynchronous communication; Computation; Computer science; Latency (audio); Secure multi-party computation; Communication complexity; Binary logarithm; Theoretical computer science; Function (biology); Distributed computing; Algorithm; Computer network; Mathematics; Discrete mathematics","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.002671706,0.0006347591,0.001109085,0.0005763526,0.001066877,0.001816191,0.002573355,0.001731049,0.005431112],"category_scores_gemma":[0.005387273,0.0003971114,0.0007084703,0.001174166,0.001219052,0.003336409,0.00451652,0.002002553,0.001626844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008120764,"about_ca_system_score_gemma":0.001100981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005143937,"about_ca_topic_score_gemma":0.0008970671,"domain_scores_codex":[0.9973598,0.0007963608,0.0001587888,0.0004424847,0.000908532,0.0003340674],"domain_scores_gemma":[0.9977089,0.001127628,0.0001443694,0.0006524051,0.0002118288,0.0001547988],"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.001068645,0.0003894052,0.0008517723,0.0003405372,0.00009764112,0.000408297,0.0005299718,0.1864682,0.02672467,0.5442017,0.0165862,0.2223331],"study_design_scores_gemma":[0.0001413971,0.00009313969,0.00007263612,0.00001394915,0.00001394358,0.00008864402,0.00003293115,0.8321065,0.006257691,0.1545307,0.006629249,0.0000192293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009903458,0.0001550626,0.9843024,0.0004208845,0.0001038609,0.0001310976,0.00009652143,0.001046341,0.003840319],"genre_scores_gemma":[0.4760906,0.0002215455,0.5133579,0.0005048593,0.0001540744,0.0004633723,0.0002763365,0.0002409473,0.008690352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005431112,"threshold_uncertainty_score":0.01816887,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03998496174303398,"score_gpt":0.1858001795842355,"score_spread":0.1458152178412015,"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."}}