{"id":"W1503321858","doi":"10.1007/978-3-642-17650-0_19","title":"Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Negotiation; Vickrey–Clarke–Groves auction; Common value auction; Commitment scheme; Generalized second-price auction; Construct (python library); Reverse auction; Auction theory; Vickrey auction; Computer security; Protocol (science); Revenue equivalence; Auction algorithm; Double auction; Distributed computing; Theoretical computer science; Cryptography; Computer network; Microeconomics; Mathematics; Law","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000903026,0.0006785303,0.0005622284,0.0009243557,0.0006455337,0.0008249454,0.003492416,0.0005371382,0.00007443622],"category_scores_gemma":[0.00006648459,0.0006435225,0.0002339077,0.00074386,0.0008471941,0.001127199,0.001829284,0.001647173,0.00003545894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004061009,"about_ca_system_score_gemma":0.0006086844,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006261855,"about_ca_topic_score_gemma":0.0002862599,"domain_scores_codex":[0.9952849,0.00004445653,0.000672462,0.001817312,0.001433857,0.0007469798],"domain_scores_gemma":[0.9965619,0.0003188885,0.0004864228,0.001965762,0.0003829409,0.000284022],"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.0001578088,0.001770621,0.001173525,0.001133195,0.0002563918,0.0006134082,0.008372486,0.09690227,0.01214947,0.6503621,0.0002077069,0.226901],"study_design_scores_gemma":[0.0009105627,0.0003021949,0.0004596001,0.001010835,0.00001598076,0.0002417254,3.124017e-7,0.6842503,0.002615298,0.2797637,0.02904435,0.001385133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003345473,0.00008199573,0.9918225,0.0005664486,0.001477845,0.005157889,0.00005306526,0.0002174054,0.000288305],"genre_scores_gemma":[0.01687595,0.000008787803,0.9809749,0.0009113203,0.0006819211,0.0004472258,0.00004987294,0.00003786469,0.00001215009],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.587348,"threshold_uncertainty_score":0.9996016,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02677564769560405,"score_gpt":0.2772296855446453,"score_spread":0.2504540378490412,"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."}}