Preventing Coercion in E-Voting: Be Open and Commit Wojtek Jamroga, - - PowerPoint PPT Presentation

preventing coercion in e voting be open and commit
SMART_READER_LITE
LIVE PREVIEW

Preventing Coercion in E-Voting: Be Open and Commit Wojtek Jamroga, - - PowerPoint PPT Presentation

Preventing Coercion in E-Voting: Be Open and Commit Wojtek Jamroga, Polish Academy of Sciences (joint work with Masoud Tabatabaei and Peter Y. A. Ryan) LAMAS Seminar on INteraction Gdansk 24th of September 2015 Tabatabaei, Jamroga, and Ryan


slide-1
SLIDE 1

Preventing Coercion in E-Voting: Be Open and Commit

Wojtek Jamroga, Polish Academy of Sciences (joint work with Masoud Tabatabaei and Peter Y. A. Ryan) LAMAS Seminar on INteraction Gdansk 24th of September 2015

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 1/26

slide-2
SLIDE 2

Introduction

Outline

1

Introduction

2

Interaction as a Game

3

Game Model of Coercion Resistance

4

Conclusions

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 2/26

slide-3
SLIDE 3

Introduction

Coercion Resistance

Desirable properties of voting schemes: privacy, anonymity, receipt-freeness, coercion resistance In this work, we focus on coercion resistance

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 3/26

slide-4
SLIDE 4

Introduction

Coercion Resistance

Desirable properties of voting schemes: privacy, anonymity, receipt-freeness, coercion resistance In this work, we focus on coercion resistance Standard definition: Coercion resistance: The voter cannot cooperate with a coercer to prove to him that she voted in a certain way.

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 3/26

slide-5
SLIDE 5

Introduction

Coercion Resistance

We look at a more fundamental property CR ≈ voter’s ability to... well, resist coercion

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 4/26

slide-6
SLIDE 6

Introduction

Coercion Resistance

We look at a more fundamental property CR ≈ voter’s ability to... well, resist coercion Coercion resistance: The system should provide good prerequisites for the voter to cast her vote according to her free intent, despite potential efforts of the coercer.

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 4/26

slide-7
SLIDE 7

Introduction

Coercion as a Game

We will model coercion as a game where different participants have possibly conflicting interests

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 5/26

slide-8
SLIDE 8

Introduction

Coercion as a Game

We will model coercion as a game where different participants have possibly conflicting interests In general: very complex An exhaustive model should include the incentives of: multiple voters, multiple coercers, possibly also social groups, business conglomerates, government agencies, etc. ...Also, we would have to define the interaction between incentives and behaviors of different groups (competition, collusion, etc.)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 5/26

slide-9
SLIDE 9

Introduction

Coercion as a Game

In this work, we settle for something much simpler We see coercion resistance as a game between:

1 a single voting authority (approximating the interests of the

society as a whole),

2 and a single coercer (approximating the interests of potential

coercers and their groups)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 6/26

slide-10
SLIDE 10

Introduction

Coercion as a Game

In this work, we settle for something much simpler We see coercion resistance as a game between:

1 a single voting authority (approximating the interests of the

society as a whole),

2 and a single coercer (approximating the interests of potential

coercers and their groups)

❀ We look at 2-player games with largely conflicting interests

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 6/26

slide-11
SLIDE 11

Introduction

Coercion as a Game Note:

We do not propose a new coercion resistant voting scheme, but a model of interaction that involves coercion!

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 7/26

slide-12
SLIDE 12

Interaction as a Game

Outline

1

Introduction

2

Interaction as a Game

3

Game Model of Coercion Resistance

4

Conclusions

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 8/26

slide-13
SLIDE 13

Interaction as a Game

Game Models: Strategic Games Definition 1 (Strategic game)

A strategic game G is a tuple (N, {Σi|i ∈ N}, o, W) that consists

  • f a nonempty finite set of players N, a nonempty set of strategies

Σi for each player i ∈ N, a nonempty set of outcomes W, an

  • utcome function o :

i∈N Σi → W which associates an outcome

with every strategy profile, and a utility function o : N × W → R which assigns agent’s payoffs (or: utility values) to each possible

  • utcome.

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 9/26

slide-14
SLIDE 14

Interaction as a Game

Example: “Twisted” Battle of Sexes

Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 10/26

slide-15
SLIDE 15

Interaction as a Game

Solution Concepts

Solution concepts define which collective behaviors are rational Formally, a solution concept is modelled as a subset of strategy profiles (= cells in the payoff table)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 11/26

slide-16
SLIDE 16

Interaction as a Game

Solution Concepts

Solution concepts define which collective behaviors are rational Formally, a solution concept is modelled as a subset of strategy profiles (= cells in the payoff table) We will use two solution concepts: Nash equilibrium and Stackelberg equilibrium

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 11/26

slide-17
SLIDE 17

Interaction as a Game

Nash Equilibrium

We look for strategy profiles which are stable under unilateral deviations Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 12/26

slide-18
SLIDE 18

Interaction as a Game

Nash Equilibrium

We look for strategy profiles which are stable under unilateral deviations Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 12/26

slide-19
SLIDE 19

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-20
SLIDE 20

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-21
SLIDE 21

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-22
SLIDE 22

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-23
SLIDE 23

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-24
SLIDE 24

Interaction as a Game

Stackelberg Equilibrium

We look for the best response to best responses Bob\Sue Bar Th Bar 2, 1 0, 0 Th 3, 0 1, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 13/26

slide-25
SLIDE 25

Interaction as a Game

Nash vs. Stackelberg

Nash equilibrium captures the outcome of mutual long-run adaptation of players to each others’ strategies

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 14/26

slide-26
SLIDE 26

Interaction as a Game

Nash vs. Stackelberg

Nash equilibrium captures the outcome of mutual long-run adaptation of players to each others’ strategies Stackelberg equilibrium captures the outcome in games where one player (the leader) exposes her strategy first

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 14/26

slide-27
SLIDE 27

Interaction as a Game

Nash vs. Stackelberg

Nash equilibrium captures the outcome of mutual long-run adaptation of players to each others’ strategies Stackelberg equilibrium captures the outcome in games where one player (the leader) exposes her strategy first Applicability of Stackelberg: the leader must be able to

1 either complete her strategy before the other players start, 2 or irrevocably commit to her strategy in advance.

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 14/26

slide-28
SLIDE 28

Interaction as a Game

Are Leaders Always at Advantage?

Bob\Sue H T H 1, 0 0, 1 T 0, 1 1, 0

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 15/26

slide-29
SLIDE 29

Interaction as a Game

Are Leaders Always at Advantage?

Bob\Sue H T H 1, 0 0, 1 T 0, 1 1, 0 No pure Nash equilibrium

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 15/26

slide-30
SLIDE 30

Interaction as a Game

Are Leaders Always at Advantage?

Bob\Sue H T H 1, 0 0, 1 T 0, 1 1, 0 No pure Nash equilibrium Unique mixed Nash equilibrium (everybody plays at random, with equal probabilities), promising each player the expected payoff of 0.5

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 15/26

slide-31
SLIDE 31

Interaction as a Game

Are Leaders Always at Advantage?

Bob\Sue H T H 1, 0 0, 1 T 0, 1 1, 0 No pure Nash equilibrium Unique mixed Nash equilibrium (everybody plays at random, with equal probabilities), promising each player the expected payoff of 0.5 Two Stackelberg equilibria, each promising Bob the payoff of 0

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 15/26

slide-32
SLIDE 32

Game Model of Coercion Resistance

Outline

1

Introduction

2

Interaction as a Game

3

Game Model of Coercion Resistance

4

Conclusions

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 16/26

slide-33
SLIDE 33

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-34
SLIDE 34

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost The society should balance the cost of anti-coercion measures vs. damage from successful coercion attacks

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-35
SLIDE 35

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost The society should balance the cost of anti-coercion measures vs. damage from successful coercion attacks Coercer: costs vs. benefits of coercion

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-36
SLIDE 36

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost The society should balance the cost of anti-coercion measures vs. damage from successful coercion attacks Coercer: costs vs. benefits of coercion

Question:

Should society invest in anti-coercion measures?

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-37
SLIDE 37

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost The society should balance the cost of anti-coercion measures vs. damage from successful coercion attacks Coercer: costs vs. benefits of coercion

Question:

Should society invest in anti-coercion measures? If so, how much?

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-38
SLIDE 38

Game Model of Coercion Resistance

Coercion as a Game

Main idea: Coercion resistance comes at a cost The society should balance the cost of anti-coercion measures vs. damage from successful coercion attacks Coercer: costs vs. benefits of coercion

Question:

Should society invest in anti-coercion measures? If so, how much? ...And, in what way?

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 17/26

slide-39
SLIDE 39

Game Model of Coercion Resistance

Game Model for Coercion Resistance

2 players: A: the honest election authority

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 18/26

slide-40
SLIDE 40

Game Model of Coercion Resistance

Game Model for Coercion Resistance

2 players: A: the honest election authority C: the coercer

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 18/26

slide-41
SLIDE 41

Game Model of Coercion Resistance

Game Model for Coercion Resistance

2 players: A: the honest election authority C: the coercer Strategies: A: choose one of anti-coercion measures a0, . . . , am

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 18/26

slide-42
SLIDE 42

Game Model of Coercion Resistance

Game Model for Coercion Resistance

2 players: A: the honest election authority C: the coercer Strategies: A: choose one of anti-coercion measures a0, . . . , am C: choose how many voters to coerce c0, . . . , cn

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 18/26

slide-43
SLIDE 43

Game Model of Coercion Resistance

Utility of the Society

uA(ai, ci) = vA(ci) − imp(ai) − δ · ci, where: vA(ci): “quality” of the election outcome (v∗

A if undisturbed,

v∗

A − ǫA if disturbed)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 19/26

slide-44
SLIDE 44

Game Model of Coercion Resistance

Utility of the Society

uA(ai, ci) = vA(ci) − imp(ai) − δ · ci, where: vA(ci): “quality” of the election outcome (v∗

A if undisturbed,

v∗

A − ǫA if disturbed)

imp(ai): cost of implementing the anti-coercion measure

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 19/26

slide-45
SLIDE 45

Game Model of Coercion Resistance

Utility of the Society

uA(ai, ci) = vA(ci) − imp(ai) − δ · ci, where: vA(ci): “quality” of the election outcome (v∗

A if undisturbed,

v∗

A − ǫA if disturbed)

imp(ai): cost of implementing the anti-coercion measure δ: corruption damage per coerced voter

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 19/26

slide-46
SLIDE 46

Game Model of Coercion Resistance

Utility of the Coercer

uC(ai, ci) = vC(ci) − β(ai) · ci, where: vC(ci): “quality” of the election outcome (v∗

C if disturbed,

v∗

C − ǫC if undisturbed)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 20/26

slide-47
SLIDE 47

Game Model of Coercion Resistance

Utility of the Coercer

uC(ai, ci) = vC(ci) − β(ai) · ci, where: vC(ci): “quality” of the election outcome (v∗

C if disturbed,

v∗

C − ǫC if undisturbed)

β(ai): Cost of coercion per voter (bribery, disclosure of votes, etc.)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 20/26

slide-48
SLIDE 48

Game Model of Coercion Resistance

Coercion Game

A\C c0 c∗ a0 v∗

A, v∗ C − ǫC

v∗

A − ǫA − δ · c∗, v∗ C − βC · c∗

. . . am v∗

A − imp(am), v∗ C − ǫC

v∗

A − ǫA − imp(am) − δ · c∗,

v∗

C − β(a1) · c∗

Note: from the coercer’s point of view, it suffices to consider only the actions of no coercion (c0) and bribing the minimal amount of voters that would swing the result of the election (c∗)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 21/26

slide-49
SLIDE 49

Game Model of Coercion Resistance

Coercion Game: Example

For m = 1, v∗

A = 5, ǫA = 3, imp(a0) = 0, imp(a1) = 1, δ = 1

c∗ = 1, v∗

C = 5, ǫC = 2, β = 3

we get A\C c0 c∗ a0 5, 3 1, 4 am 4, 3 0, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 22/26

slide-50
SLIDE 50

Game Model of Coercion Resistance

Coercion Game: Example

For m = 1, v∗

A = 5, ǫA = 3, imp(a0) = 0, imp(a1) = 1, δ = 1

c∗ = 1, v∗

C = 5, ǫC = 2, β = 3

we get A\C c0 c∗ a0 5, 3 1, 4 am 4, 3 0, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 22/26

slide-51
SLIDE 51

Game Model of Coercion Resistance

Coercion Game: Example

For m = 1, v∗

A = 5, ǫA = 3, imp(a0) = 0, imp(a1) = 1, δ = 1

c∗ = 1, v∗

C = 5, ǫC = 2, β = 3

we get A\C c0 c∗ a0 5, 3 1, 4 am 4, 3 0, 2

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 22/26

slide-52
SLIDE 52

Game Model of Coercion Resistance

Coercion Game: Example

For m = 1, v∗

A = 5, ǫA = 3, imp(a0) = 0, imp(a1) = 1, δ = 1

c∗ = 1, v∗

C = 5, ǫC = 2, β = 3

we get A\C c0 c∗ a0 5, 3 1, 4 am 4, 3 0, 2 Playing Stackelberg is much more profitable than Nash!

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 22/26

slide-53
SLIDE 53

Game Model of Coercion Resistance

Coercion Game: General Result Theorem 2

Under some mild assumptions, we get the following:

1 The coercion game has a unique Nash equilibrium in (a0, c∗), 2 The Stackelberg equilibrium is (am, c0), and 3 Stackelberg equilibrium is preferred to Nash equilibrium, i.e.,

uA(a0, c∗) < uA(am, c0).

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 23/26

slide-54
SLIDE 54

Game Model of Coercion Resistance

Coercion Game: General Result Theorem 2

Under some mild assumptions, we get the following:

1 The coercion game has a unique Nash equilibrium in (a0, c∗), 2 The Stackelberg equilibrium is (am, c0), and 3 Stackelberg equilibrium is preferred to Nash equilibrium, i.e.,

uA(a0, c∗) < uA(am, c0). Note: the society enforces the coercer not to coerce (c0) by publicly committing to high-security policy (am)

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 23/26

slide-55
SLIDE 55

Conclusions

Outline

1

Introduction

2

Interaction as a Game

3

Game Model of Coercion Resistance

4

Conclusions

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 24/26

slide-56
SLIDE 56

Conclusions

Conclusions

The work is very preliminary, but...

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 25/26

slide-57
SLIDE 57

Conclusions

Conclusions

The work is very preliminary, but... ...our analysis suggests that the society should not adapt to what it expects from the bad guys

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 25/26

slide-58
SLIDE 58

Conclusions

Conclusions

The work is very preliminary, but... ...our analysis suggests that the society should not adapt to what it expects from the bad guys Committing publicly to an anti-coercion policy prevents coercing attempts

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 25/26

slide-59
SLIDE 59

Conclusions

Conclusions

The work is very preliminary, but... ...our analysis suggests that the society should not adapt to what it expects from the bad guys Committing publicly to an anti-coercion policy prevents coercing attempts No coercion resistance through obscurity!

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 25/26

slide-60
SLIDE 60

Conclusions

Thank you for your attention

Tabatabaei, Jamroga, and Ryan · Preventing Coercion in E-Voting Gdansk, 24/09/2015 26/26