In: Lecture Notes in Computer Science Ser. v.10141
Intro -- Preface -- Organization -- Contents -- Preventing Coercion in E-Voting: Be Open and Commit -- 1 Introduction -- 2 Game-Theoretic Preliminaries -- 2.1 Strategic Games -- 2.2 Solution Concepts -- 2.3 Pure Vs. Mixed Strategies -- 3 A Simple Game Model of Coercion -- 3.1 Players, Strategies, Utilities -- 3.2 Coercion Against Perfect Protection -- 3.3 Coercion Game for Breakable Protection -- 4 Coercion with Incomplete Information -- 4.1 Bayesian Game for Coercion -- 4.2 Uniform Probabilistic Beliefs -- 4.3 Normal Probabilistic Beliefs -- 5 Conclusions -- References -- Automatic Margin Computation for Risk-Limiting Audits -- 1 Introduction -- 2 Risk-Limiting Audits and Election Margins -- 3 Software Bounded Model Checking -- 4 Automated Margin Computation Using SBMC -- 5 Margin Computation for the D'Hondt Method -- 6 Using SBMC to Find Parameters in Election Function -- 7 Computing the Margin for National Danish Elections -- 8 Conclusion and Future Work -- References -- E-Voting in Developing Countries -- Abstract -- 1 Introduction -- 2 The Need for an Ecological View in E-Voting Research -- 3 Research Method -- 3.1 Literature Sampling -- 3.2 Research Themes Classification -- 4 Findings and Discussion -- 4.1 Descriptive Overview of the Result -- 4.2 The Thematic Landscape of the Current Research -- 5 Recommendations -- 6 Conclusion -- Acknowledgement -- Appendix: List of Articles Included in the Final Dataset -- References -- Truly Multi-authority `Prêt-à-Voter' -- 1 Introduction -- 1.1 Background -- 1.2 Our Solution -- 1.3 Motivation and Contribution -- 2 Prêt à Voter -- 3 Overview of Our Solution -- 3.1 Differences Compared to a Mixnet -- 4 Variant 1: Human-Computable Permutation -- 5 Variant 2: EBM Assisted Variant -- 6 Practical Matters -- 6.1 Auditing -- 6.2 What Do We Do in Case of Failure? -- 7 Conclusion -- References.
In: Lecture notes in computer science 10141
Problem melden